./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-3a.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_4-3a.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 c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:37:18,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:37:18,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:37:18,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:37:18,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:37:18,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:37:18,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:37:18,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:37:18,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:37:18,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:37:18,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:37:18,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:37:18,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:37:18,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:37:18,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:37:18,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:37:18,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:37:18,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:37:18,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:37:18,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:37:18,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:37:18,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:37:18,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:37:18,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:37:18,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:37:18,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:37:18,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:37:18,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:37:18,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:37:18,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:37:18,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:37:18,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:37:18,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:37:18,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:37:18,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:37:18,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:37:18,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:37:18,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:37:18,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:37:18,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:37:18,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:37:18,617 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:18,645 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:37:18,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:37:18,646 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:37:18,646 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:37:18,648 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:37:18,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:37:18,648 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:37:18,648 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:37:18,648 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:37:18,649 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:37:18,650 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:37:18,650 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:37:18,650 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:37:18,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:37:18,650 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:37:18,650 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:37:18,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:37:18,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:37:18,651 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:37:18,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:37:18,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:37:18,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:37:18,652 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:37:18,652 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:37:18,652 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:37:18,652 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:37:18,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:37:18,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:37:18,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:37:18,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:37:18,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:37:18,654 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:37:18,655 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2022-02-21 03:37:18,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:37:18,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:37:18,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:37:18,856 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:37:18,856 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:37:18,857 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-02-21 03:37:18,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bb9b5ed3/fc5738c6dfd44507b3ff0b363fd5dd8d/FLAG4e54c260d [2022-02-21 03:37:19,252 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:37:19,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-02-21 03:37:19,258 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bb9b5ed3/fc5738c6dfd44507b3ff0b363fd5dd8d/FLAG4e54c260d [2022-02-21 03:37:19,685 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bb9b5ed3/fc5738c6dfd44507b3ff0b363fd5dd8d [2022-02-21 03:37:19,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:37:19,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:37:19,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:37:19,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:37:19,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:37:19,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:37:19" (1/1) ... [2022-02-21 03:37:19,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@736798f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:19, skipping insertion in model container [2022-02-21 03:37:19,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:37:19" (1/1) ... [2022-02-21 03:37:19,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:37:19,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:37:19,884 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_4-3a.c.cil.c[730,743] [2022-02-21 03:37:19,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:37:19,962 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:37:19,972 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_4-3a.c.cil.c[730,743] [2022-02-21 03:37:20,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:37:20,038 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:37:20,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:20 WrapperNode [2022-02-21 03:37:20,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:37:20,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:37:20,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:37:20,041 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:37:20,045 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:20" (1/1) ... [2022-02-21 03:37:20,060 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:20" (1/1) ... [2022-02-21 03:37:20,087 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 499 [2022-02-21 03:37:20,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:37:20,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:37:20,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:37:20,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:37:20,094 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:20" (1/1) ... [2022-02-21 03:37:20,094 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:20" (1/1) ... [2022-02-21 03:37:20,096 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:20" (1/1) ... [2022-02-21 03:37:20,097 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:20" (1/1) ... [2022-02-21 03:37:20,104 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:20" (1/1) ... [2022-02-21 03:37:20,113 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:20" (1/1) ... [2022-02-21 03:37:20,114 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:20" (1/1) ... [2022-02-21 03:37:20,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:37:20,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:37:20,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:37:20,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:37:20,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:20" (1/1) ... [2022-02-21 03:37:20,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:20,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:20,152 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:20,157 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:20,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:37:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:37:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:37:20,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:37:20,320 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:37:20,321 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:37:20,869 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:37:20,876 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:37:20,876 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-21 03:37:20,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:37:20 BoogieIcfgContainer [2022-02-21 03:37:20,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:37:20,879 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:37:20,879 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:37:20,882 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:37:20,883 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:20,883 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:37:19" (1/3) ... [2022-02-21 03:37:20,884 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60d2a05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:37:20, skipping insertion in model container [2022-02-21 03:37:20,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:20,884 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:20" (2/3) ... [2022-02-21 03:37:20,884 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60d2a05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:37:20, skipping insertion in model container [2022-02-21 03:37:20,885 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:20,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:37:20" (3/3) ... [2022-02-21 03:37:20,886 INFO L388 chiAutomizerObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2022-02-21 03:37:20,918 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:37:20,918 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:37:20,918 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:37:20,918 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:37:20,918 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:37:20,918 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:37:20,919 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:37:20,919 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:37:20,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 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,970 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-02-21 03:37:20,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:20,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:20,975 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:37:20,976 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:20,976 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:37:20,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 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,987 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-02-21 03:37:20,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:20,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:20,988 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:37:20,988 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:21,001 INFO L791 eck$LassoCheckResult]: Stem: 137#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(24, 2);call #Ultimate.allocInit(12, 3); 42#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~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; 98#L29true assume !(0 == base2flt_~m#1 % 4294967296); 135#L35true assume !(base2flt_~m#1 % 4294967296 < 16777216); 57#L57-2true [2022-02-21 03:37:21,003 INFO L793 eck$LassoCheckResult]: Loop: 57#L57-2true assume !false; 41#L58true assume base2flt_~m#1 % 4294967296 >= 33554432; 113#L59true assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 57#L57-2true [2022-02-21 03:37:21,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:21,011 INFO L85 PathProgramCache]: Analyzing trace with hash 925696, now seen corresponding path program 1 times [2022-02-21 03:37:21,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:21,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587177910] [2022-02-21 03:37:21,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:21,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#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(24, 2);call #Ultimate.allocInit(12, 3); {163#true} is VALID [2022-02-21 03:37:21,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~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; {165#(= |ULTIMATE.start_base2flt_~m#1| 0)} is VALID [2022-02-21 03:37:21,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#(= |ULTIMATE.start_base2flt_~m#1| 0)} assume !(0 == base2flt_~m#1 % 4294967296); {165#(= |ULTIMATE.start_base2flt_~m#1| 0)} is VALID [2022-02-21 03:37:21,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {165#(= |ULTIMATE.start_base2flt_~m#1| 0)} assume !(base2flt_~m#1 % 4294967296 < 16777216); {164#false} is VALID [2022-02-21 03:37:21,170 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,170 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:21,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587177910] [2022-02-21 03:37:21,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587177910] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:37:21,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:37:21,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:37:21,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022929598] [2022-02-21 03:37:21,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:37:21,177 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash 74612, now seen corresponding path program 1 times [2022-02-21 03:37:21,178 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:21,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317205172] [2022-02-21 03:37:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:21,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:21,190 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:21,208 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:21,242 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:21,242 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:21,243 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:21,243 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:21,243 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:21,243 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:21,243 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:21,243 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:21,243 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_4-3a.c.cil.c_Iteration1_Loop [2022-02-21 03:37:21,244 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:21,244 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:21,256 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,265 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,408 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:21,408 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:21,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:21,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:21,412 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:21,422 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:21,422 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:21,447 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:21,469 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:37:21,469 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:21,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:21,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:21,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:21,493 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:21,495 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:21,498 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:21,498 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:21,539 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:21,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:21,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:21,542 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:21,543 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:21,548 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:21,548 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:21,576 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:21,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:37:21,581 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:21,582 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:21,582 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:21,582 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:21,582 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:21,582 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:21,582 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:21,582 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:21,583 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_4-3a.c.cil.c_Iteration1_Loop [2022-02-21 03:37:21,583 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:21,583 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:21,583 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,592 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,683 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:21,687 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:21,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:21,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:21,689 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:21,691 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:21,693 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,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:21,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:21,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:21,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:21,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:21,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:21,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:21,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:21,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:37:21,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:21,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:21,741 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:21,743 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:21,744 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,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:21,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:21,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:21,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:21,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:21,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:21,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:21,759 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:21,763 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:21,763 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:21,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:21,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:21,765 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:21,769 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:21,769 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:21,772 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:21,772 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:21,772 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,793 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:21,814 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:21,825 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,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:21,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#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(24, 2);call #Ultimate.allocInit(12, 3); {168#unseeded} is VALID [2022-02-21 03:37:21,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~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; {168#unseeded} is VALID [2022-02-21 03:37:21,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {168#unseeded} is VALID [2022-02-21 03:37:21,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {168#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {168#unseeded} is VALID [2022-02-21 03:37:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:21,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {171#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:21,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {171#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:21,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#(>= 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; {181#(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,980 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:21,988 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:21,989 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:21,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,994 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,996 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 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:22,064 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:22,394 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 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 491 states and 850 transitions. Complement of second has 6 states. [2022-02-21 03:37:22,396 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:22,396 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:22,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 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,407 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-02-21 03:37:22,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:22,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:22,408 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:22,416 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:37:22,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:22,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:22,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 491 states and 850 transitions. [2022-02-21 03:37:22,422 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2022-02-21 03:37:22,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:22,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:22,427 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 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,435 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-02-21 03:37:22,437 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 18 examples of accepted words. [2022-02-21 03:37:22,438 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:22,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:37:22,446 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:37:22,446 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 491 states and 850 transitions. cyclomatic complexity: 373 [2022-02-21 03:37:22,449 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 27 examples of accepted words. [2022-02-21 03:37:22,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,450 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:22,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:22,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,452 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:22,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:22,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,454 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:22,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:22,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 491 letters. Loop has 491 letters. [2022-02-21 03:37:22,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,456 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 491 letters. Loop has 491 letters. [2022-02-21 03:37:22,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 491 letters. Loop has 491 letters. [2022-02-21 03:37:22,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 159 letters. Loop has 159 letters. [2022-02-21 03:37:22,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,458 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 159 letters. Loop has 159 letters. [2022-02-21 03:37:22,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 159 letters. Loop has 159 letters. [2022-02-21 03:37:22,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,459 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:22,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:37:22,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,461 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:22,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:22,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,462 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:22,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:22,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,464 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:22,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:22,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,466 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:22,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:22,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,467 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:22,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:22,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,469 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:22,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:22,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,470 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:22,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:22,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,472 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:22,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:22,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,473 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:22,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:22,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,475 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:22,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:22,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,476 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:22,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:22,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,478 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:22,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:22,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,479 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:22,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:22,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,481 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:22,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:22,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,482 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:22,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:22,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,484 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:22,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:22,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,485 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:22,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:22,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,487 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:22,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:22,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,488 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:22,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:22,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,490 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:22,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:22,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,491 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:22,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:22,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,493 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:22,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:22,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,494 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:22,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:22,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,496 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:22,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:22,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,497 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:22,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:22,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,499 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:22,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:22,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,500 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:22,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:22,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,501 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:22,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:22,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,503 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:22,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:22,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,504 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:22,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:22,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,506 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:22,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:22,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,507 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:22,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:22,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,508 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:22,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:22,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,510 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:22,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:22,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,511 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:22,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:22,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,512 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:22,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:22,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,514 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:22,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:22,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,515 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:22,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:22,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,517 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:22,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:22,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,518 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:22,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:22,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,519 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:22,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:22,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,521 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:22,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:22,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,522 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:22,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:22,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,524 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:22,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:22,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,525 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:22,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:22,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,526 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:22,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:22,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 159 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 158 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:22,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,528 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:22,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 491 states and 850 transitions. cyclomatic complexity: 373 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:22,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,528 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:22,532 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:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2022-02-21 03:37:22,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 556 transitions. Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:22,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 556 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:22,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 556 transitions. Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:37:22,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:22,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 491 states and 850 transitions. cyclomatic complexity: 373 [2022-02-21 03:37:22,589 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2022-02-21 03:37:22,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 491 states to 89 states and 146 transitions. [2022-02-21 03:37:22,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2022-02-21 03:37:22,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2022-02-21 03:37:22,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 146 transitions. [2022-02-21 03:37:22,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:22,598 INFO L681 BuchiCegarLoop]: Abstraction has 89 states and 146 transitions. [2022-02-21 03:37:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 146 transitions. [2022-02-21 03:37:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 70. [2022-02-21 03:37:22,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:22,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states and 146 transitions. Second operand has 70 states, 70 states have (on average 1.6857142857142857) internal successors, (118), 69 states have internal predecessors, (118), 0 states have call successors, (0), 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,625 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states and 146 transitions. Second operand has 70 states, 70 states have (on average 1.6857142857142857) internal successors, (118), 69 states have internal predecessors, (118), 0 states have call successors, (0), 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,627 INFO L87 Difference]: Start difference. First operand 89 states and 146 transitions. Second operand has 70 states, 70 states have (on average 1.6857142857142857) internal successors, (118), 69 states have internal predecessors, (118), 0 states have call successors, (0), 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,629 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:22,634 INFO L93 Difference]: Finished difference Result 89 states and 146 transitions. [2022-02-21 03:37:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 146 transitions. [2022-02-21 03:37:22,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:22,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:22,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 70 states have (on average 1.6857142857142857) internal successors, (118), 69 states have internal predecessors, (118), 0 states have call successors, (0), 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 89 states and 146 transitions. [2022-02-21 03:37:22,636 INFO L87 Difference]: Start difference. First operand has 70 states, 70 states have (on average 1.6857142857142857) internal successors, (118), 69 states have internal predecessors, (118), 0 states have call successors, (0), 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 89 states and 146 transitions. [2022-02-21 03:37:22,637 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:22,641 INFO L93 Difference]: Finished difference Result 89 states and 146 transitions. [2022-02-21 03:37:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 146 transitions. [2022-02-21 03:37:22,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:22,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:22,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:22,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.6857142857142857) internal successors, (118), 69 states have internal predecessors, (118), 0 states have call successors, (0), 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,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 118 transitions. [2022-02-21 03:37:22,645 INFO L704 BuchiCegarLoop]: Abstraction has 70 states and 118 transitions. [2022-02-21 03:37:22,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:22,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:37:22,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:37:22,649 INFO L87 Difference]: Start difference. First operand 70 states and 118 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:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:22,743 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2022-02-21 03:37:22,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:37:22,743 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:22,747 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:22,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 57 transitions. [2022-02-21 03:37:22,749 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:22,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 57 transitions. [2022-02-21 03:37:22,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-02-21 03:37:22,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-02-21 03:37:22,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 57 transitions. [2022-02-21 03:37:22,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:22,750 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 57 transitions. [2022-02-21 03:37:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 57 transitions. [2022-02-21 03:37:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-02-21 03:37:22,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:22,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states and 57 transitions. Second operand has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 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,752 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states and 57 transitions. Second operand has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 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,752 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 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,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:22,753 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2022-02-21 03:37:22,753 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2022-02-21 03:37:22,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:22,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:22,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 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 39 states and 57 transitions. [2022-02-21 03:37:22,753 INFO L87 Difference]: Start difference. First operand has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 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 39 states and 57 transitions. [2022-02-21 03:37:22,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:22,754 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2022-02-21 03:37:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2022-02-21 03:37:22,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:22,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:22,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:22,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 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,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2022-02-21 03:37:22,755 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 48 transitions. [2022-02-21 03:37:22,755 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 48 transitions. [2022-02-21 03:37:22,755 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:37:22,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 48 transitions. [2022-02-21 03:37:22,755 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:22,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:22,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:22,756 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:22,756 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:22,768 INFO L791 eck$LassoCheckResult]: Stem: 1194#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(24, 2);call #Ultimate.allocInit(12, 3); 1172#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~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; 1173#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1196#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 1175#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 := 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; 1176#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 1177#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 1178#L47-3 [2022-02-21 03:37:22,768 INFO L793 eck$LassoCheckResult]: Loop: 1178#L47-3 assume !false; 1195#L38-1 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 1187#L47-2 assume base2flt_~m#1 % 4294967296 < 16777216; 1178#L47-3 [2022-02-21 03:37:22,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:22,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1807920711, now seen corresponding path program 1 times [2022-02-21 03:37:22,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:22,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55706976] [2022-02-21 03:37:22,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:22,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:22,779 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:22,799 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:22,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:22,799 INFO L85 PathProgramCache]: Analyzing trace with hash 153118, now seen corresponding path program 1 times [2022-02-21 03:37:22,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:22,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443712604] [2022-02-21 03:37:22,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:22,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:22,807 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:22,818 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:22,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:22,819 INFO L85 PathProgramCache]: Analyzing trace with hash 876132888, now seen corresponding path program 1 times [2022-02-21 03:37:22,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:22,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6736050] [2022-02-21 03:37:22,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:22,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:22,846 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:22,873 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:22,900 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:22,900 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:22,900 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:22,900 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:22,900 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:22,900 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:22,900 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:22,900 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:22,900 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_4-3a.c.cil.c_Iteration2_Loop [2022-02-21 03:37:22,900 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:22,900 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:22,902 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:22,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:22,982 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:22,982 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:22,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:22,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:22,983 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:22,993 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:22,994 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:22,994 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:23,050 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:23,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:23,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:23,052 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:23,054 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:23,056 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:23,056 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:23,099 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:23,107 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:23,107 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:23,107 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:23,107 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:23,107 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:23,107 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:23,107 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:23,107 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:23,108 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:23,108 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_4-3a.c.cil.c_Iteration2_Loop [2022-02-21 03:37:23,108 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:23,108 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:23,110 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:23,116 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:23,203 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:23,203 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:23,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:23,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:23,204 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:23,206 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:23,207 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:23,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:23,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:23,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:23,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:23,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:23,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:23,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:23,230 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:23,232 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:23,232 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:23,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:23,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:23,244 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:23,245 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:23,264 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:23,264 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:23,264 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:23,264 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:23,290 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:23,309 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:23,314 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:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:23,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:23,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:23,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:23,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {1286#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(24, 2);call #Ultimate.allocInit(12, 3); {1286#unseeded} is VALID [2022-02-21 03:37:23,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {1286#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~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; {1286#unseeded} is VALID [2022-02-21 03:37:23,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {1286#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {1286#unseeded} is VALID [2022-02-21 03:37:23,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {1286#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {1286#unseeded} is VALID [2022-02-21 03:37:23,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {1286#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 := 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; {1286#unseeded} is VALID [2022-02-21 03:37:23,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {1286#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {1286#unseeded} is VALID [2022-02-21 03:37:23,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {1286#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {1286#unseeded} is VALID [2022-02-21 03:37:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:23,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:23,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:23,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {1289#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !false; {1289#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} is VALID [2022-02-21 03:37:23,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {1289#(>= 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; {1325#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} is VALID [2022-02-21 03:37:23,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {1325#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} assume base2flt_~m#1 % 4294967296 < 16777216; {1299#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))) unseeded)} is VALID [2022-02-21 03:37:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:23,447 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:23,451 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:23,452 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:23,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,452 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:23,453 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 48 transitions. cyclomatic complexity: 19 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:23,536 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 48 transitions. cyclomatic complexity: 19. 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 69 states and 103 transitions. Complement of second has 5 states. [2022-02-21 03:37:23,537 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:23,537 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:23,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 48 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:23,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:23,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:23,538 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:23,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:23,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:23,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:23,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 103 transitions. [2022-02-21 03:37:23,540 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2022-02-21 03:37:23,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:23,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:23,540 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 48 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:23,541 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 03:37:23,541 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:23,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:23,542 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:23,543 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 69 states and 103 transitions. cyclomatic complexity: 40 [2022-02-21 03:37:23,544 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2022-02-21 03:37:23,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:23,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,544 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:23,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:23,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:23,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,545 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:23,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:23,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:23,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,546 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:23,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:23,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 69 letters. Loop has 69 letters. [2022-02-21 03:37:23,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,547 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 69 letters. Loop has 69 letters. [2022-02-21 03:37:23,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 69 letters. Loop has 69 letters. [2022-02-21 03:37:23,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 33 letters. Loop has 33 letters. [2022-02-21 03:37:23,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,547 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 33 letters. Loop has 33 letters. [2022-02-21 03:37:23,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 33 letters. Loop has 33 letters. [2022-02-21 03:37:23,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:23,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,548 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:23,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:23,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:23,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,549 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:23,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:23,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:23,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,550 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:23,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:23,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:23,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,551 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:23,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:23,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:23,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,552 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:23,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:23,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:23,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,552 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:23,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:23,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:23,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,553 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:23,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:23,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:23,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,554 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:23,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:23,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:23,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,555 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:23,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:23,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:23,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,556 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:23,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:23,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:23,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,557 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:23,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:23,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:23,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,557 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:23,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:23,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:23,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,558 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:23,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:23,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:23,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,559 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:23,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:23,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:23,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,560 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:23,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:23,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:23,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,561 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:23,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:23,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:23,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,561 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:23,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:23,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:23,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,562 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:23,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:23,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:23,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,563 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:23,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:23,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:23,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,564 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:23,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:23,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:23,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,565 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:23,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:23,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:23,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,566 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:23,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:23,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:23,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,567 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:23,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:23,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:23,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,567 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:23,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:23,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:23,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,568 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:23,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:23,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:23,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,569 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:23,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:23,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:23,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,570 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:23,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:23,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:23,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,571 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:23,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:23,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:23,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,572 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:23,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:23,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,572 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:23,573 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:23,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-02-21 03:37:23,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:23,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:23,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:37:23,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:23,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 103 transitions. cyclomatic complexity: 40 [2022-02-21 03:37:23,576 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2022-02-21 03:37:23,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 57 states and 82 transitions. [2022-02-21 03:37:23,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2022-02-21 03:37:23,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-02-21 03:37:23,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 82 transitions. [2022-02-21 03:37:23,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:23,579 INFO L681 BuchiCegarLoop]: Abstraction has 57 states and 82 transitions. [2022-02-21 03:37:23,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 82 transitions. [2022-02-21 03:37:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2022-02-21 03:37:23,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:23,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states and 82 transitions. Second operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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:23,581 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states and 82 transitions. Second operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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:23,581 INFO L87 Difference]: Start difference. First operand 57 states and 82 transitions. Second operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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:23,582 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:23,584 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2022-02-21 03:37:23,584 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2022-02-21 03:37:23,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:23,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:23,584 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 82 transitions. [2022-02-21 03:37:23,585 INFO L87 Difference]: Start difference. First operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 82 transitions. [2022-02-21 03:37:23,585 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:23,587 INFO L93 Difference]: Finished difference Result 58 states and 83 transitions. [2022-02-21 03:37:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2022-02-21 03:37:23,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:23,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:23,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:23,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:23,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2022-02-21 03:37:23,589 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-02-21 03:37:23,589 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-02-21 03:37:23,589 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:37:23,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 52 transitions. [2022-02-21 03:37:23,590 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:37:23,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:23,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:23,590 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:23,590 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:23,591 INFO L791 eck$LassoCheckResult]: Stem: 1435#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(24, 2);call #Ultimate.allocInit(12, 3); 1411#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~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; 1412#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1438#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 1413#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 := 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; 1414#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 1416#L35-1 assume !(base2flt_~m#1 % 4294967296 < 16777216); 1418#L57-5 [2022-02-21 03:37:23,591 INFO L793 eck$LassoCheckResult]: Loop: 1418#L57-5 assume !false; 1419#L58-1 assume base2flt_~m#1 % 4294967296 >= 33554432; 1420#L59-1 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 1418#L57-5 [2022-02-21 03:37:23,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:23,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1807920737, now seen corresponding path program 1 times [2022-02-21 03:37:23,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:23,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301297768] [2022-02-21 03:37:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:23,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:23,602 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:23,611 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:23,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:23,612 INFO L85 PathProgramCache]: Analyzing trace with hash 178877, now seen corresponding path program 1 times [2022-02-21 03:37:23,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:23,612 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12698260] [2022-02-21 03:37:23,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:23,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:23,618 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:23,623 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:23,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:23,624 INFO L85 PathProgramCache]: Analyzing trace with hash 876933213, now seen corresponding path program 1 times [2022-02-21 03:37:23,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:23,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666875680] [2022-02-21 03:37:23,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:23,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:23,635 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:23,646 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:23,716 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:23,731 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:23,731 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:23,731 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:23,732 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:23,732 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:23,732 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:23,732 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:23,732 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:23,732 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_4-3a.c.cil.c_Iteration3_Loop [2022-02-21 03:37:23,732 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:23,732 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:23,733 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:23,739 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:23,835 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:23,835 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:23,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:23,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:23,852 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:23,854 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:23,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:23,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:23,893 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:37:23,894 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:23,902 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:23,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:23,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:23,916 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:23,917 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:23,919 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:23,919 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:23,951 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:23,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:23,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:23,953 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:23,955 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:23,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:23,957 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:23,992 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:23,996 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:23,997 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:23,997 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:23,997 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:23,997 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:23,997 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:23,997 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:23,997 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:23,997 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:23,997 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_4-3a.c.cil.c_Iteration3_Loop [2022-02-21 03:37:23,997 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:23,997 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:23,998 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:24,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:24,113 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:24,113 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:24,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:24,119 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:24,121 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:24,122 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:24,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:24,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:24,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:24,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:24,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:24,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:24,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:24,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:24,176 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:24,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:24,178 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:24,185 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:24,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:24,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:24,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:24,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:24,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:24,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:24,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:24,195 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:24,211 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:24,213 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:24,213 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:24,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:24,215 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:24,216 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:24,217 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:24,217 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:24,218 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:24,218 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:24,245 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:24,255 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:24,258 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:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:24,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:24,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:24,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:24,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {1680#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(24, 2);call #Ultimate.allocInit(12, 3); {1680#unseeded} is VALID [2022-02-21 03:37:24,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {1680#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~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; {1680#unseeded} is VALID [2022-02-21 03:37:24,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {1680#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {1680#unseeded} is VALID [2022-02-21 03:37:24,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {1680#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {1680#unseeded} is VALID [2022-02-21 03:37:24,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {1680#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 := 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; {1680#unseeded} is VALID [2022-02-21 03:37:24,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {1680#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {1680#unseeded} is VALID [2022-02-21 03:37:24,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {1680#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {1680#unseeded} is VALID [2022-02-21 03:37:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:24,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:24,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:24,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {1683#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {1683#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:24,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {1683#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {1683#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:24,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {1683#(>= 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; {1693#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))))} is VALID [2022-02-21 03:37:24,344 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:24,344 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:24,348 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:24,349 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:24,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,349 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:24,349 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 52 transitions. cyclomatic complexity: 20 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:24,441 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 52 transitions. cyclomatic complexity: 20. 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 71 states and 106 transitions. Complement of second has 5 states. [2022-02-21 03:37:24,442 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:24,442 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:24,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 52 transitions. cyclomatic complexity: 20 [2022-02-21 03:37:24,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:24,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:24,442 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:24,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:24,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:24,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:24,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 106 transitions. [2022-02-21 03:37:24,444 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:24,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:24,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:24,445 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 52 transitions. cyclomatic complexity: 20 [2022-02-21 03:37:24,446 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:37:24,446 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:24,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:24,447 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:24,447 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 71 states and 106 transitions. cyclomatic complexity: 41 [2022-02-21 03:37:24,448 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 03:37:24,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:24,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,449 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:24,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:24,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:24,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,449 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:24,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:24,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:24,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,450 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:24,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:24,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 71 letters. Loop has 71 letters. [2022-02-21 03:37:24,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,451 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 71 letters. Loop has 71 letters. [2022-02-21 03:37:24,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 71 letters. Loop has 71 letters. [2022-02-21 03:37:24,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:37:24,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,452 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 36 letters. Loop has 36 letters. [2022-02-21 03:37:24,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:37:24,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:24,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,453 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:24,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:24,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:24,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,453 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:24,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:24,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:24,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,454 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:24,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:24,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:24,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,455 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:24,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:24,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:24,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,456 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:24,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:24,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:24,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,457 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:24,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:24,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:24,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,457 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:24,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:24,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:24,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,458 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:24,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:24,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:24,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,459 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:24,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:24,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:24,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,460 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:24,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:24,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:24,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,461 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:24,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:24,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:24,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,461 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:24,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:24,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:24,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,462 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:24,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:24,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:24,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,463 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:24,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:24,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:24,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,464 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:24,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:24,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:24,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,464 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:24,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:24,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:24,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,465 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:24,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:24,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:24,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,466 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:24,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:24,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:24,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,467 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:24,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:24,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:24,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,468 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:24,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:24,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:24,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,468 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:24,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:24,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:24,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,469 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:24,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:24,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:24,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,470 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:24,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:24,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,470 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:24,471 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:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-02-21 03:37:24,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:24,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:24,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:37:24,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:24,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 106 transitions. cyclomatic complexity: 41 [2022-02-21 03:37:24,475 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:24,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 59 states and 85 transitions. [2022-02-21 03:37:24,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2022-02-21 03:37:24,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2022-02-21 03:37:24,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 85 transitions. [2022-02-21 03:37:24,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:24,477 INFO L681 BuchiCegarLoop]: Abstraction has 59 states and 85 transitions. [2022-02-21 03:37:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 85 transitions. [2022-02-21 03:37:24,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-02-21 03:37:24,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:24,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states and 85 transitions. Second operand has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 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:24,479 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states and 85 transitions. Second operand has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 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:24,480 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 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:24,480 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:24,482 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2022-02-21 03:37:24,482 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2022-02-21 03:37:24,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:24,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:24,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 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 59 states and 85 transitions. [2022-02-21 03:37:24,483 INFO L87 Difference]: Start difference. First operand has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 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 59 states and 85 transitions. [2022-02-21 03:37:24,483 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:24,485 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2022-02-21 03:37:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2022-02-21 03:37:24,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:24,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:24,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:24,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 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:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2022-02-21 03:37:24,487 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2022-02-21 03:37:24,487 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2022-02-21 03:37:24,487 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:37:24,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. [2022-02-21 03:37:24,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:37:24,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:24,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:24,488 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:24,488 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:24,489 INFO L791 eck$LassoCheckResult]: Stem: 1833#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(24, 2);call #Ultimate.allocInit(12, 3); 1806#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~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; 1807#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1836#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 1808#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 := 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; 1809#L29-1 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1810#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 1823#L80-1 main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~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_~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; 1830#L29-2 assume !(0 == base2flt_~m#1 % 4294967296); 1827#L35-2 assume !(base2flt_~m#1 % 4294967296 < 16777216); 1828#L57-8 [2022-02-21 03:37:24,489 INFO L793 eck$LassoCheckResult]: Loop: 1828#L57-8 assume !false; 1821#L58-2 assume base2flt_~m#1 % 4294967296 >= 33554432; 1822#L59-2 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 1828#L57-8 [2022-02-21 03:37:24,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:24,489 INFO L85 PathProgramCache]: Analyzing trace with hash 877203369, now seen corresponding path program 1 times [2022-02-21 03:37:24,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:24,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187675263] [2022-02-21 03:37:24,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:24,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:24,501 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:24,510 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:24,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:24,511 INFO L85 PathProgramCache]: Analyzing trace with hash 283142, now seen corresponding path program 1 times [2022-02-21 03:37:24,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:24,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943620844] [2022-02-21 03:37:24,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:24,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:24,517 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:24,521 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:24,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:24,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2110176930, now seen corresponding path program 1 times [2022-02-21 03:37:24,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:24,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206031215] [2022-02-21 03:37:24,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:24,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:24,534 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:24,545 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:24,569 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:24,569 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:24,569 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:24,569 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:24,569 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:24,569 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,569 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:24,570 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:24,570 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_4-3a.c.cil.c_Iteration4_Loop [2022-02-21 03:37:24,570 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:24,570 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:24,570 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:24,575 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:24,674 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:24,674 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:24,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:24,688 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:24,689 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:24,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:24,691 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:24,739 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:24,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:24,742 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:24,749 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:24,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:24,750 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:24,775 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:24,781 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:24,782 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:24,782 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:24,782 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:24,782 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:24,782 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:24,782 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,782 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:24,782 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:24,782 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_4-3a.c.cil.c_Iteration4_Loop [2022-02-21 03:37:24,782 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:24,782 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:24,785 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:24,791 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:24,901 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:24,901 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:24,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:24,903 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:24,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:37:24,906 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:24,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:24,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:24,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:24,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:24,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:24,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:24,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:24,921 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:24,927 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:24,927 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:24,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:24,929 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:24,930 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:24,931 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:24,932 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:24,932 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:24,932 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:24,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:24,968 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:24,972 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:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:25,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:25,073 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:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:25,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:25,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:25,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {2082#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(24, 2);call #Ultimate.allocInit(12, 3); {2082#unseeded} is VALID [2022-02-21 03:37:25,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {2082#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~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; {2082#unseeded} is VALID [2022-02-21 03:37:25,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {2082#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {2082#unseeded} is VALID [2022-02-21 03:37:25,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {2082#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {2082#unseeded} is VALID [2022-02-21 03:37:25,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {2082#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 := 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; {2082#unseeded} is VALID [2022-02-21 03:37:25,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {2082#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {2082#unseeded} is VALID [2022-02-21 03:37:25,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {2082#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {2082#unseeded} is VALID [2022-02-21 03:37:25,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {2082#unseeded} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~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_~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; {2082#unseeded} is VALID [2022-02-21 03:37:25,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {2082#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {2082#unseeded} is VALID [2022-02-21 03:37:25,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {2082#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {2082#unseeded} is VALID [2022-02-21 03:37:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:25,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:25,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:25,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {2085#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {2085#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:25,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {2085#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {2085#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:25,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {2085#(>= 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; {2095#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))))} is VALID [2022-02-21 03:37:25,148 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:25,148 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:25,154 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:25,158 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:25,158 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,158 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:25,159 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 56 transitions. cyclomatic complexity: 21 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:25,187 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 56 transitions. cyclomatic complexity: 21. 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) Result 42 states and 60 transitions. Complement of second has 4 states. [2022-02-21 03:37:25,187 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:25,187 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:25,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. cyclomatic complexity: 21 [2022-02-21 03:37:25,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:25,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:25,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. 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:25,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:25,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:25,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:25,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 60 transitions. [2022-02-21 03:37:25,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:25,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:25,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:25,189 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 56 transitions. cyclomatic complexity: 21 [2022-02-21 03:37:25,189 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:37:25,189 INFO L70 LassoExtractor]: Start lassoExtractor. 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:25,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:25,190 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:25,190 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 60 transitions. cyclomatic complexity: 22 [2022-02-21 03:37:25,190 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:37:25,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,190 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:25,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,191 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:25,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:25,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,194 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:37:25,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,195 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:37:25,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:37:25,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:37:25,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,195 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:37:25,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:37:25,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:25,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,195 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:25,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:25,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,195 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,196 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,196 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,196 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,197 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,197 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:25,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,197 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:25,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:25,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,197 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,198 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,198 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,198 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:25,199 INFO L82 GeneralOperation]: Start removeUnreachable. 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:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-21 03:37:25,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:37:25,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 60 transitions. cyclomatic complexity: 22 [2022-02-21 03:37:25,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:25,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 36 states and 52 transitions. [2022-02-21 03:37:25,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-02-21 03:37:25,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-02-21 03:37:25,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 52 transitions. [2022-02-21 03:37:25,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:25,201 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-02-21 03:37:25,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 52 transitions. [2022-02-21 03:37:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-21 03:37:25,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:25,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 52 transitions. Second operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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:25,202 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 52 transitions. Second operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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:25,203 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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:25,203 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:25,203 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-02-21 03:37:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2022-02-21 03:37:25,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:25,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:25,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 36 states and 52 transitions. [2022-02-21 03:37:25,204 INFO L87 Difference]: Start difference. First operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 36 states and 52 transitions. [2022-02-21 03:37:25,204 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:25,204 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-02-21 03:37:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2022-02-21 03:37:25,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:25,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:25,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:25,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:25,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2022-02-21 03:37:25,205 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-02-21 03:37:25,205 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-02-21 03:37:25,205 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:37:25,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 52 transitions. [2022-02-21 03:37:25,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:25,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:25,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:25,206 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:25,206 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:25,206 INFO L791 eck$LassoCheckResult]: Stem: 2211#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(24, 2);call #Ultimate.allocInit(12, 3); 2187#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~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; 2188#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 2214#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 2189#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 := 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; 2190#L29-1 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 2191#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 2202#L80-1 main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~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_~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; 2208#L29-2 assume !(0 == base2flt_~m#1 % 4294967296); 2206#L35-2 assume base2flt_~m#1 % 4294967296 < 16777216; 2207#L47-5 [2022-02-21 03:37:25,206 INFO L793 eck$LassoCheckResult]: Loop: 2207#L47-5 assume !false; 2210#L38-2 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 2215#L47-4 assume base2flt_~m#1 % 4294967296 < 16777216; 2207#L47-5 [2022-02-21 03:37:25,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:25,207 INFO L85 PathProgramCache]: Analyzing trace with hash 877203343, now seen corresponding path program 1 times [2022-02-21 03:37:25,207 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:25,207 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023943114] [2022-02-21 03:37:25,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:25,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:25,214 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:25,221 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:25,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:25,222 INFO L85 PathProgramCache]: Analyzing trace with hash 257383, now seen corresponding path program 1 times [2022-02-21 03:37:25,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:25,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417665062] [2022-02-21 03:37:25,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:25,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:25,225 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:25,227 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:25,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:25,227 INFO L85 PathProgramCache]: Analyzing trace with hash -2110977255, now seen corresponding path program 1 times [2022-02-21 03:37:25,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:25,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023637480] [2022-02-21 03:37:25,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:25,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:25,239 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:25,256 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:25,278 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:25,279 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:25,279 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:25,279 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:25,279 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:25,279 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:25,279 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:25,279 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:25,279 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_4-3a.c.cil.c_Iteration5_Loop [2022-02-21 03:37:25,279 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:25,279 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:25,280 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:25,283 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:25,348 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:25,348 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:25,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:25,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:25,352 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:25,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:25,355 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:25,364 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:25,403 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:25,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:25,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:25,407 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:25,407 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:25,409 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:25,409 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:25,443 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:25,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:25,447 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:25,447 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:25,447 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:25,447 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:25,447 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:25,447 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:25,447 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:25,447 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:25,447 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_4-3a.c.cil.c_Iteration5_Loop [2022-02-21 03:37:25,447 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:25,447 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:25,447 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:25,452 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:25,531 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:25,531 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:25,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:25,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:25,532 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:25,533 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:25,535 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:25,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:25,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:25,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:25,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:25,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:25,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:25,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:25,544 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:25,545 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:25,546 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:25,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:25,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:25,547 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:25,548 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:25,549 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:25,549 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:25,549 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:25,549 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:25,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:37:25,577 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:25,580 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:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:25,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:25,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:25,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:25,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {2388#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(24, 2);call #Ultimate.allocInit(12, 3); {2388#unseeded} is VALID [2022-02-21 03:37:25,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {2388#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_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~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_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~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; {2388#unseeded} is VALID [2022-02-21 03:37:25,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {2388#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {2388#unseeded} is VALID [2022-02-21 03:37:25,655 INFO L290 TraceCheckUtils]: 3: Hoare triple {2388#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {2388#unseeded} is VALID [2022-02-21 03:37:25,655 INFO L290 TraceCheckUtils]: 4: Hoare triple {2388#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 := 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; {2388#unseeded} is VALID [2022-02-21 03:37:25,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {2388#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {2388#unseeded} is VALID [2022-02-21 03:37:25,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {2388#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {2388#unseeded} is VALID [2022-02-21 03:37:25,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {2388#unseeded} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~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_~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; {2388#unseeded} is VALID [2022-02-21 03:37:25,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {2388#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {2388#unseeded} is VALID [2022-02-21 03:37:25,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {2388#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {2388#unseeded} is VALID [2022-02-21 03:37:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:25,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:25,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:25,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {2391#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !false; {2391#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} is VALID [2022-02-21 03:37:25,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {2391#(>= 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; {2436#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} is VALID [2022-02-21 03:37:25,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {2436#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} assume base2flt_~m#1 % 4294967296 < 16777216; {2401#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))) unseeded)} is VALID [2022-02-21 03:37:25,718 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:25,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:25,725 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:25,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,725 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:25,725 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 52 transitions. cyclomatic complexity: 19 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:25,753 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 52 transitions. cyclomatic complexity: 19. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Result 40 states and 56 transitions. Complement of second has 4 states. [2022-02-21 03:37:25,753 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:25,753 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:25,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 52 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:25,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:25,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:25,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:25,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:25,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:25,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:25,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 56 transitions. [2022-02-21 03:37:25,755 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:25,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:25,755 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 52 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:25,755 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:37:25,755 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:25,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:25,756 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:25,756 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 56 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:25,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 56 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:25,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:25,756 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:37:25,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:25,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:25,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:25,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:37:25,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:37:25,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:37:25,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:37:25,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:37:25,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:37:25,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:25,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:25,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:25,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:25,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:25,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:25,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,762 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-02-21 03:37:25,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:37:25,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 56 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:25,765 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:25,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2022-02-21 03:37:25,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:37:25,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:37:25,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:37:25,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:25,766 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:25,766 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:25,766 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:25,766 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:37:25,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:37:25,767 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:25,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:25,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:37:25 BoogieIcfgContainer [2022-02-21 03:37:25,773 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:37:25,773 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:37:25,773 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:37:25,774 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:37:25,774 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:20" (3/4) ... [2022-02-21 03:37:25,776 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:37:25,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:37:25,777 INFO L158 Benchmark]: Toolchain (without parser) took 6088.46ms. Allocated memory was 113.2MB in the beginning and 155.2MB in the end (delta: 41.9MB). Free memory was 81.4MB in the beginning and 62.5MB in the end (delta: 18.9MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. [2022-02-21 03:37:25,777 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 73.4MB. Free memory was 36.3MB in the beginning and 36.2MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:37:25,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.13ms. Allocated memory is still 113.2MB. Free memory was 81.1MB in the beginning and 85.0MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:37:25,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.08ms. Allocated memory is still 113.2MB. Free memory was 85.0MB in the beginning and 80.6MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:37:25,778 INFO L158 Benchmark]: Boogie Preprocessor took 28.89ms. Allocated memory is still 113.2MB. Free memory was 80.6MB in the beginning and 77.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:37:25,778 INFO L158 Benchmark]: RCFGBuilder took 760.71ms. Allocated memory is still 113.2MB. Free memory was 77.8MB in the beginning and 70.4MB in the end (delta: 7.4MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2022-02-21 03:37:25,778 INFO L158 Benchmark]: BuchiAutomizer took 4893.90ms. Allocated memory was 113.2MB in the beginning and 155.2MB in the end (delta: 41.9MB). Free memory was 70.4MB in the beginning and 62.5MB in the end (delta: 7.9MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2022-02-21 03:37:25,778 INFO L158 Benchmark]: Witness Printer took 2.51ms. Allocated memory is still 155.2MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:37:25,779 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.15ms. Allocated memory is still 73.4MB. Free memory was 36.3MB in the beginning and 36.2MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.13ms. Allocated memory is still 113.2MB. Free memory was 81.1MB in the beginning and 85.0MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.08ms. Allocated memory is still 113.2MB. Free memory was 85.0MB in the beginning and 80.6MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.89ms. Allocated memory is still 113.2MB. Free memory was 80.6MB in the beginning and 77.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 760.71ms. Allocated memory is still 113.2MB. Free memory was 77.8MB in the beginning and 70.4MB in the end (delta: 7.4MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4893.90ms. Allocated memory was 113.2MB in the beginning and 155.2MB in the end (delta: 41.9MB). Free memory was 70.4MB in the beginning and 62.5MB in the end (delta: 7.9MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. * Witness Printer took 2.51ms. Allocated memory is still 155.2MB. Free memory is still 62.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 6 terminating modules (1 trivial, 5 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. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.1s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 66 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 3. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 480 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 480 mSDsluCounter, 536 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 484 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf100 lsp56 ukn100 mio100 lsp100 div570 bol100 ite100 ukn100 eq132 hnf96 smp42 dnf100 smp100 tf105 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 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:25,812 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:26,007 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