./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:37:07,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:37:07,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:37:07,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:37:07,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:37:07,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:37:07,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:37:07,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:37:07,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:37:07,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:37:07,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:37:07,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:37:07,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:37:07,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:37:07,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:37:07,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:37:07,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:37:07,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:37:07,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:37:07,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:37:07,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:37:07,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:37:07,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:37:07,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:37:07,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:37:07,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:37:07,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:37:07,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:37:07,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:37:07,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:37:07,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:37:07,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:37:07,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:37:07,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:37:07,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:37:07,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:37:07,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:37:07,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:37:07,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:37:07,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:37:07,223 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:37:07,224 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:07,253 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:37:07,253 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:37:07,254 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:37:07,254 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:37:07,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:37:07,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:37:07,255 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:37:07,255 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:37:07,255 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:37:07,255 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:37:07,256 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:37:07,256 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:37:07,256 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:37:07,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:37:07,257 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:37:07,257 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:37:07,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:37:07,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:37:07,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:37:07,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:37:07,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:37:07,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:37:07,258 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:37:07,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:37:07,258 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:37:07,258 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:37:07,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:37:07,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:37:07,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:37:07,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:37:07,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:37:07,260 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:37:07,260 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 -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2022-02-21 03:37:07,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:37:07,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:37:07,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:37:07,524 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:37:07,525 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:37:07,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2022-02-21 03:37:07,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404477515/760e869fcaa04c51946a11021e3f9d4b/FLAG9a2712848 [2022-02-21 03:37:07,949 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:37:07,949 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2022-02-21 03:37:07,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404477515/760e869fcaa04c51946a11021e3f9d4b/FLAG9a2712848 [2022-02-21 03:37:08,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404477515/760e869fcaa04c51946a11021e3f9d4b [2022-02-21 03:37:08,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:37:08,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:37:08,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:37:08,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:37:08,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:37:08,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:37:08" (1/1) ... [2022-02-21 03:37:08,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a1b4ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:08, skipping insertion in model container [2022-02-21 03:37:08,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:37:08" (1/1) ... [2022-02-21 03:37:08,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:37:08,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:37:08,529 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_1-2a.c.cil.c[755,768] [2022-02-21 03:37:08,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:37:08,642 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:37:08,657 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_1-2a.c.cil.c[755,768] [2022-02-21 03:37:08,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:37:08,721 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:37:08,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:08 WrapperNode [2022-02-21 03:37:08,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:37:08,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:37:08,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:37:08,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:37:08,730 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:08" (1/1) ... [2022-02-21 03:37:08,742 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:08" (1/1) ... [2022-02-21 03:37:08,794 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 13, calls inlined = 11, statements flattened = 428 [2022-02-21 03:37:08,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:37:08,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:37:08,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:37:08,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:37:08,803 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:08" (1/1) ... [2022-02-21 03:37:08,803 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:08" (1/1) ... [2022-02-21 03:37:08,815 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:08" (1/1) ... [2022-02-21 03:37:08,818 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:08" (1/1) ... [2022-02-21 03:37:08,829 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:08" (1/1) ... [2022-02-21 03:37:08,836 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:08" (1/1) ... [2022-02-21 03:37:08,838 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:08" (1/1) ... [2022-02-21 03:37:08,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:37:08,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:37:08,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:37:08,843 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:37:08,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:08" (1/1) ... [2022-02-21 03:37:08,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:08,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:08,883 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:08,894 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:08,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:37:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:37:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:37:08,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:37:08,970 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:37:08,972 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:37:09,552 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:37:09,567 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:37:09,568 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-21 03:37:09,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:37:09 BoogieIcfgContainer [2022-02-21 03:37:09,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:37:09,573 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:37:09,573 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:37:09,576 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:37:09,576 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:09,577 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:37:08" (1/3) ... [2022-02-21 03:37:09,578 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@698a80bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:37:09, skipping insertion in model container [2022-02-21 03:37:09,578 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:09,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:08" (2/3) ... [2022-02-21 03:37:09,579 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@698a80bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:37:09, skipping insertion in model container [2022-02-21 03:37:09,579 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:09,579 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:37:09" (3/3) ... [2022-02-21 03:37:09,583 INFO L388 chiAutomizerObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2022-02-21 03:37:09,621 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:37:09,622 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:37:09,622 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:37:09,622 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:37:09,622 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:37:09,622 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:37:09,622 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:37:09,622 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:37:09,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 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:09,678 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-02-21 03:37:09,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:09,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:09,683 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:37:09,683 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:09,683 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:37:09,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 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:09,700 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-02-21 03:37:09,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:09,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:09,701 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:37:09,701 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:09,705 INFO L791 eck$LassoCheckResult]: Stem: 127#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); 45#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~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; 75#L30true assume !(0 == base2flt_~m#1 % 4294967296); 134#L36true assume !(base2flt_~m#1 % 4294967296 < 16777216); 23#L58-2true [2022-02-21 03:37:09,705 INFO L793 eck$LassoCheckResult]: Loop: 23#L58-2true assume !false; 110#L59true assume base2flt_~m#1 % 4294967296 >= 33554432; 141#L60true assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 23#L58-2true [2022-02-21 03:37:09,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:09,709 INFO L85 PathProgramCache]: Analyzing trace with hash 925696, now seen corresponding path program 1 times [2022-02-21 03:37:09,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:09,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506088164] [2022-02-21 03:37:09,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:09,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:09,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#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); {148#true} is VALID [2022-02-21 03:37:09,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~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; {150#(= |ULTIMATE.start_base2flt_~m#1| 0)} is VALID [2022-02-21 03:37:09,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#(= |ULTIMATE.start_base2flt_~m#1| 0)} assume !(0 == base2flt_~m#1 % 4294967296); {150#(= |ULTIMATE.start_base2flt_~m#1| 0)} is VALID [2022-02-21 03:37:09,882 INFO L290 TraceCheckUtils]: 3: Hoare triple {150#(= |ULTIMATE.start_base2flt_~m#1| 0)} assume !(base2flt_~m#1 % 4294967296 < 16777216); {149#false} is VALID [2022-02-21 03:37:09,883 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:09,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:09,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506088164] [2022-02-21 03:37:09,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506088164] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:37:09,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:37:09,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:37:09,888 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593635769] [2022-02-21 03:37:09,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:37:09,892 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:09,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:09,894 INFO L85 PathProgramCache]: Analyzing trace with hash 74612, now seen corresponding path program 1 times [2022-02-21 03:37:09,894 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:09,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022826253] [2022-02-21 03:37:09,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:09,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:09,916 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:09,931 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:09,992 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:09,993 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:09,993 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:09,993 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:09,993 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:09,993 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:09,994 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:09,994 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:09,994 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-2a.c.cil.c_Iteration1_Loop [2022-02-21 03:37:09,994 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:09,994 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:10,015 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:10,032 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:10,137 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:10,137 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:10,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:10,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:10,140 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:10,151 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:10,152 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:10,159 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:10,184 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:37:10,184 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:10,213 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:10,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:10,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:10,218 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:10,219 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:10,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:10,221 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:10,280 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:10,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:10,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:10,282 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:10,283 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:10,285 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:10,285 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:10,328 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:10,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:10,333 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:10,333 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:10,333 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:10,333 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:10,333 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:10,333 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:10,333 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:10,333 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:10,333 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-2a.c.cil.c_Iteration1_Loop [2022-02-21 03:37:10,334 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:10,334 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:10,334 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:10,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:10,458 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:10,461 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:10,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:10,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:10,465 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:10,483 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:10,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:10,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:10,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:10,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:10,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:10,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:10,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:10,498 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:10,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:10,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:10,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:10,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:10,545 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:10,547 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:10,549 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:10,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:10,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:10,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:10,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:10,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:10,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:10,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:10,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:10,583 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:10,583 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:10,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:10,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:10,588 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:10,623 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:10,623 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:10,624 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:10,624 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:10,624 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:10,649 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:10,669 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:10,675 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:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:10,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:10,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:10,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:10,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#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); {153#unseeded} is VALID [2022-02-21 03:37:10,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~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; {153#unseeded} is VALID [2022-02-21 03:37:10,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {153#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {153#unseeded} is VALID [2022-02-21 03:37:10,757 INFO L290 TraceCheckUtils]: 3: Hoare triple {153#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {153#unseeded} is VALID [2022-02-21 03:37:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:10,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:10,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:10,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {156#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {156#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:10,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {156#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:10,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#(>= 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; {166#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))))} is VALID [2022-02-21 03:37:10,789 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:10,819 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:10,827 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:10,829 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:10,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:10,833 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:10,837 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 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:11,173 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 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 440 states and 755 transitions. Complement of second has 6 states. [2022-02-21 03:37:11,173 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:11,174 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:11,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 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:11,181 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-02-21 03:37:11,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:11,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:11,182 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:11,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:37:11,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:11,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:11,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 440 states and 755 transitions. [2022-02-21 03:37:11,195 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2022-02-21 03:37:11,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:11,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:11,198 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 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:11,225 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-02-21 03:37:11,228 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 18 examples of accepted words. [2022-02-21 03:37:11,228 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:11,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:37:11,234 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:37:11,234 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 440 states and 755 transitions. cyclomatic complexity: 329 [2022-02-21 03:37:11,252 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 27 examples of accepted words. [2022-02-21 03:37:11,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,254 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:11,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,256 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:11,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:11,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,258 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:11,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 440 letters. Loop has 440 letters. [2022-02-21 03:37:11,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,260 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 440 letters. Loop has 440 letters. [2022-02-21 03:37:11,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 440 letters. Loop has 440 letters. [2022-02-21 03:37:11,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 144 letters. [2022-02-21 03:37:11,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,262 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 144 letters. Loop has 144 letters. [2022-02-21 03:37:11,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 144 letters. Loop has 144 letters. [2022-02-21 03:37:11,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,266 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:11,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:37:11,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,272 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:11,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,273 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:11,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,281 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:11,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:11,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,283 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:11,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,284 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:11,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,285 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:11,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:11,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,286 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:11,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:11,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,287 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:11,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:11,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,297 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:11,301 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:11,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:11,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,302 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:11,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:11,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,304 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:11,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:11,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,305 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:11,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:11,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,306 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:11,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:11,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,307 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:11,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,308 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:11,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:11,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,309 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:11,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:11,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,310 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:11,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:11,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,311 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:11,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,312 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:11,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:11,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,313 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:11,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:11,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,314 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:11,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:11,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,316 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:11,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,317 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:11,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,318 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:11,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,319 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:11,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,320 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:11,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:11,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,321 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:11,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:11,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,322 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:11,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:11,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,323 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:11,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:11,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,324 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:11,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:11,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,325 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:11,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:11,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,326 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:11,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:11,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,327 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:11,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,328 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:11,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:11,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,329 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:11,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:11,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,330 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:11,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:11,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,331 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:11,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:11,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,332 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:11,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:11,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,333 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:11,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:11,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,334 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:11,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:11,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,334 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:11,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:11,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,337 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:11,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,338 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:11,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,339 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:11,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:11,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,340 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:11,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,340 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:11,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 144 states, 143 states have (on average 1.7482517482517483) internal successors, (250), 143 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:11,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,341 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:11,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 440 states and 755 transitions. cyclomatic complexity: 329 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:11,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,341 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:11,346 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:11,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 498 transitions. [2022-02-21 03:37:11,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 498 transitions. Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 498 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:11,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 498 transitions. Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:37:11,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 440 states and 755 transitions. cyclomatic complexity: 329 [2022-02-21 03:37:11,377 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2022-02-21 03:37:11,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 440 states to 89 states and 146 transitions. [2022-02-21 03:37:11,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2022-02-21 03:37:11,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2022-02-21 03:37:11,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 146 transitions. [2022-02-21 03:37:11,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:11,385 INFO L681 BuchiCegarLoop]: Abstraction has 89 states and 146 transitions. [2022-02-21 03:37:11,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 146 transitions. [2022-02-21 03:37:11,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 70. [2022-02-21 03:37:11,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:11,414 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:11,424 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:11,427 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:11,429 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:11,436 INFO L93 Difference]: Finished difference Result 89 states and 146 transitions. [2022-02-21 03:37:11,437 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 146 transitions. [2022-02-21 03:37:11,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:11,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:11,441 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:11,445 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:11,446 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:11,454 INFO L93 Difference]: Finished difference Result 89 states and 146 transitions. [2022-02-21 03:37:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 146 transitions. [2022-02-21 03:37:11,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:11,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:11,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:11,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:11,456 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:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 118 transitions. [2022-02-21 03:37:11,459 INFO L704 BuchiCegarLoop]: Abstraction has 70 states and 118 transitions. [2022-02-21 03:37:11,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:11,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:37:11,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:37:11,464 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:11,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:11,557 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2022-02-21 03:37:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:37:11,557 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:11,562 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:11,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 57 transitions. [2022-02-21 03:37:11,565 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:11,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 57 transitions. [2022-02-21 03:37:11,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-02-21 03:37:11,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-02-21 03:37:11,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 57 transitions. [2022-02-21 03:37:11,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:11,568 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 57 transitions. [2022-02-21 03:37:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 57 transitions. [2022-02-21 03:37:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-02-21 03:37:11,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:11,571 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:11,571 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:11,571 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:11,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:11,573 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2022-02-21 03:37:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2022-02-21 03:37:11,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:11,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:11,574 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:11,574 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:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:11,576 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2022-02-21 03:37:11,576 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2022-02-21 03:37:11,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:11,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:11,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:11,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:11,579 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:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2022-02-21 03:37:11,580 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 48 transitions. [2022-02-21 03:37:11,581 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 48 transitions. [2022-02-21 03:37:11,581 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:37:11,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 48 transitions. [2022-02-21 03:37:11,581 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:11,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:11,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:11,582 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:11,582 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:11,582 INFO L791 eck$LassoCheckResult]: Stem: 1127#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); 1116#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~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; 1105#L30 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1106#L80 base2flt_#res#1 := base2flt_~__retres4~0#1; 1117#L81 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; 1130#L30-1 assume !(0 == base2flt_~m#1 % 4294967296); 1125#L36-1 assume base2flt_~m#1 % 4294967296 < 16777216; 1103#L48-3 [2022-02-21 03:37:11,582 INFO L793 eck$LassoCheckResult]: Loop: 1103#L48-3 assume !false; 1124#L39-1 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 1102#L48-2 assume base2flt_~m#1 % 4294967296 < 16777216; 1103#L48-3 [2022-02-21 03:37:11,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:11,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1807920711, now seen corresponding path program 1 times [2022-02-21 03:37:11,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:11,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879314782] [2022-02-21 03:37:11,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:11,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:11,609 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:11,628 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:11,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:11,629 INFO L85 PathProgramCache]: Analyzing trace with hash 153118, now seen corresponding path program 1 times [2022-02-21 03:37:11,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:11,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672165815] [2022-02-21 03:37:11,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:11,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:11,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:11,642 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:11,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:11,642 INFO L85 PathProgramCache]: Analyzing trace with hash 876132888, now seen corresponding path program 1 times [2022-02-21 03:37:11,642 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:11,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618529507] [2022-02-21 03:37:11,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:11,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:11,683 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:11,704 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:11,733 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:11,733 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:11,733 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:11,734 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:11,734 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:11,734 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:11,734 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:11,734 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:11,734 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-2a.c.cil.c_Iteration2_Loop [2022-02-21 03:37:11,734 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:11,734 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:11,735 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:11,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:11,849 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:11,850 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:11,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:11,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:11,864 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:11,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:11,888 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:11,896 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:11,933 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:11,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:11,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:11,944 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:11,987 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:11,989 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:11,989 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:12,043 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:12,055 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:12,055 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:12,055 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:12,055 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:12,055 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:12,056 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:12,056 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:12,056 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:12,056 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:12,056 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-2a.c.cil.c_Iteration2_Loop [2022-02-21 03:37:12,056 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:12,056 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:12,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:12,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:12,167 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:12,168 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:12,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:12,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:12,170 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:12,170 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:12,172 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:12,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:12,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:12,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:12,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:12,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:12,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:12,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:12,182 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:12,199 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:12,200 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:12,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:12,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:12,202 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:12,203 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:12,204 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:12,204 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:12,204 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:12,204 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:12,230 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:12,248 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:12,252 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:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:12,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:12,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:12,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:12,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {1220#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); {1220#unseeded} is VALID [2022-02-21 03:37:12,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {1220#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~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; {1220#unseeded} is VALID [2022-02-21 03:37:12,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {1220#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {1220#unseeded} is VALID [2022-02-21 03:37:12,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {1220#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {1220#unseeded} is VALID [2022-02-21 03:37:12,310 INFO L290 TraceCheckUtils]: 4: Hoare triple {1220#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; {1220#unseeded} is VALID [2022-02-21 03:37:12,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {1220#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {1220#unseeded} is VALID [2022-02-21 03:37:12,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {1220#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {1220#unseeded} is VALID [2022-02-21 03:37:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:12,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:12,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:12,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {1223#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !false; {1223#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} is VALID [2022-02-21 03:37:12,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {1223#(>= 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; {1259#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} is VALID [2022-02-21 03:37:12,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {1259#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} assume base2flt_~m#1 % 4294967296 < 16777216; {1233#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))) unseeded)} is VALID [2022-02-21 03:37:12,420 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:12,421 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:12,426 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:12,426 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:12,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,427 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:12,427 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:12,570 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:12,570 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:12,571 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:12,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 48 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:12,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:12,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:12,571 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:12,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:12,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:12,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:12,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 103 transitions. [2022-02-21 03:37:12,573 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2022-02-21 03:37:12,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:12,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:12,574 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 48 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:12,575 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 03:37:12,575 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:12,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:12,576 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:12,577 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 69 states and 103 transitions. cyclomatic complexity: 40 [2022-02-21 03:37:12,578 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2022-02-21 03:37:12,578 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:12,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,578 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:12,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,579 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:12,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,579 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:12,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,590 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:12,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,590 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:12,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,590 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:12,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,591 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:12,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,591 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:12,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,591 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:12,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,592 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:12,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,592 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:12,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,592 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:12,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,592 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:12,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,593 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:12,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,593 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:12,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,593 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:12,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,593 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:12,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,594 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:12,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,594 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:12,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,594 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:12,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,595 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:12,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,595 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:12,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,595 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:12,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,595 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:12,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,596 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:12,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,596 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:12,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,596 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:12,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,597 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:12,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,597 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:12,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,597 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:12,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,597 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:12,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,598 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:12,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,598 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:12,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,598 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:12,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,599 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:12,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,599 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:12,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,599 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:12,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,599 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:12,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,600 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:12,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,600 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:12,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,600 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:12,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,601 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:12,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,601 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:12,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,601 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:12,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,601 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:12,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,602 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:12,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,602 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:12,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,602 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:12,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,603 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:12,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,603 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:12,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,603 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:12,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,603 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:12,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,604 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:12,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,604 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:12,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,604 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:12,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,605 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:12,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,605 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:12,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,605 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:12,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,605 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:12,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,606 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:12,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,606 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:12,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,606 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:12,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,607 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:12,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,607 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:12,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,607 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:12,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,607 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:12,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,608 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:12,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,608 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:12,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,608 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:12,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,609 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:12,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,609 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:12,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,609 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:12,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,609 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:12,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,610 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:12,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,610 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:12,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,610 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:12,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,611 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:12,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,611 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:12,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,611 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:12,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,611 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:12,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,612 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:12,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,612 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:12,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,612 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:12,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,612 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:12,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,613 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:12,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,613 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:12,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,613 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:12,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,614 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:12,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,614 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:12,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,614 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:12,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,614 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:12,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,615 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:12,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,615 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:12,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,615 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:12,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,616 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:12,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,616 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:12,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,616 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:12,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,617 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:12,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,617 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:12,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,617 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:12,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,617 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:12,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,618 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:12,618 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:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-02-21 03:37:12,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:12,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:37:12,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 103 transitions. cyclomatic complexity: 40 [2022-02-21 03:37:12,623 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2022-02-21 03:37:12,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 57 states and 82 transitions. [2022-02-21 03:37:12,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2022-02-21 03:37:12,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-02-21 03:37:12,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 82 transitions. [2022-02-21 03:37:12,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:12,626 INFO L681 BuchiCegarLoop]: Abstraction has 57 states and 82 transitions. [2022-02-21 03:37:12,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 82 transitions. [2022-02-21 03:37:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2022-02-21 03:37:12,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:12,628 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:12,629 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:12,629 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:12,629 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:12,631 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2022-02-21 03:37:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2022-02-21 03:37:12,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:12,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:12,632 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:12,633 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:12,633 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:12,635 INFO L93 Difference]: Finished difference Result 58 states and 83 transitions. [2022-02-21 03:37:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2022-02-21 03:37:12,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:12,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:12,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:12,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:12,636 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:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2022-02-21 03:37:12,638 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-02-21 03:37:12,638 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-02-21 03:37:12,638 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:37:12,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 52 transitions. [2022-02-21 03:37:12,638 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:37:12,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:12,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:12,639 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:12,639 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:12,639 INFO L791 eck$LassoCheckResult]: Stem: 1369#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); 1356#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~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; 1345#L30 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1346#L80 base2flt_#res#1 := base2flt_~__retres4~0#1; 1361#L81 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; 1372#L30-1 assume !(0 == base2flt_~m#1 % 4294967296); 1366#L36-1 assume !(base2flt_~m#1 % 4294967296 < 16777216); 1355#L58-5 [2022-02-21 03:37:12,639 INFO L793 eck$LassoCheckResult]: Loop: 1355#L58-5 assume !false; 1363#L59-1 assume base2flt_~m#1 % 4294967296 >= 33554432; 1353#L60-1 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 1355#L58-5 [2022-02-21 03:37:12,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1807920737, now seen corresponding path program 1 times [2022-02-21 03:37:12,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:12,641 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433634216] [2022-02-21 03:37:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:12,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,652 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,663 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:12,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:12,664 INFO L85 PathProgramCache]: Analyzing trace with hash 178877, now seen corresponding path program 1 times [2022-02-21 03:37:12,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:12,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779804229] [2022-02-21 03:37:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:12,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,671 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,678 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:12,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:12,679 INFO L85 PathProgramCache]: Analyzing trace with hash 876933213, now seen corresponding path program 1 times [2022-02-21 03:37:12,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:12,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707448802] [2022-02-21 03:37:12,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:12,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,692 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,705 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:12,733 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:12,733 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:12,733 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:12,733 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:12,733 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:12,734 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:12,734 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:12,734 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:12,734 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-2a.c.cil.c_Iteration3_Loop [2022-02-21 03:37:12,734 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:12,734 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:12,735 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:12,740 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:12,843 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:12,844 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:12,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:12,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:12,869 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:12,870 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:12,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:12,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:12,916 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:37:12,916 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:12,942 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:12,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:12,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:12,955 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:12,956 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:12,958 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:12,958 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:12,998 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:12,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:12,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:13,020 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:13,021 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:13,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:13,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:13,071 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:13,077 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:13,077 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:13,078 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:13,078 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:13,078 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:13,078 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:13,078 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,078 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:13,078 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:13,078 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-2a.c.cil.c_Iteration3_Loop [2022-02-21 03:37:13,078 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:13,078 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:13,079 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:13,084 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:13,133 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:13,191 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:13,191 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:13,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:13,208 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:13,228 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:13,228 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:13,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:13,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:13,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:13,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:13,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:13,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:13,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:13,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:13,280 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:13,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:13,282 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:13,316 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:13,323 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:13,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:13,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:13,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:13,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:13,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:13,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:13,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:13,339 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:13,343 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:13,343 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:13,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:13,356 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:13,371 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:13,372 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:13,372 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:13,372 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:13,372 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:13,396 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:13,403 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:13,406 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:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:13,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:13,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:13,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:13,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {1614#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); {1614#unseeded} is VALID [2022-02-21 03:37:13,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {1614#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~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; {1614#unseeded} is VALID [2022-02-21 03:37:13,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {1614#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {1614#unseeded} is VALID [2022-02-21 03:37:13,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {1614#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {1614#unseeded} is VALID [2022-02-21 03:37:13,459 INFO L290 TraceCheckUtils]: 4: Hoare triple {1614#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; {1614#unseeded} is VALID [2022-02-21 03:37:13,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {1614#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {1614#unseeded} is VALID [2022-02-21 03:37:13,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {1614#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {1614#unseeded} is VALID [2022-02-21 03:37:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:13,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:13,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:13,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {1617#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {1617#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:13,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {1617#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {1617#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:13,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {1617#(>= 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; {1627#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))))} is VALID [2022-02-21 03:37:13,482 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:13,482 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:13,486 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:13,487 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:13,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,487 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:13,487 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:13,584 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:13,584 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:13,584 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:13,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 52 transitions. cyclomatic complexity: 20 [2022-02-21 03:37:13,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:13,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:13,585 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:13,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:13,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:13,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:13,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 106 transitions. [2022-02-21 03:37:13,587 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:13,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:13,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:13,587 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 52 transitions. cyclomatic complexity: 20 [2022-02-21 03:37:13,588 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:37:13,588 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:13,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:13,589 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:13,589 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 71 states and 106 transitions. cyclomatic complexity: 41 [2022-02-21 03:37:13,589 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 03:37:13,589 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:13,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,590 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:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,590 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:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,590 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:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,590 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:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,590 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:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,590 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:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,590 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:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,591 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:13,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,591 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:13,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 71 letters. [2022-02-21 03:37:13,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,591 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:13,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,591 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:13,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:37:13,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,591 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:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,592 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:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,592 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:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,592 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:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,592 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:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,593 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:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,593 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:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,593 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:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,593 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:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,593 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:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,593 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:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,593 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:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,594 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:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,594 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:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,594 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:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,594 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:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,595 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:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,595 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:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,595 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:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,595 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:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,596 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:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,596 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:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,596 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:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,596 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:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,596 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:13,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,597 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:13,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:13,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,597 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:13,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,597 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:13,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:13,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,597 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:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,598 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:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,598 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:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,598 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:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,598 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:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,598 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:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,599 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:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,599 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:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,599 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:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,599 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:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,599 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:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,600 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:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,600 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:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,600 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:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,600 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:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,600 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:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,601 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:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,601 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:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,601 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:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,601 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:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,602 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:13,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,602 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:13,602 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:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-02-21 03:37:13,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:13,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:37:13,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 106 transitions. cyclomatic complexity: 41 [2022-02-21 03:37:13,605 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:13,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 59 states and 85 transitions. [2022-02-21 03:37:13,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2022-02-21 03:37:13,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2022-02-21 03:37:13,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 85 transitions. [2022-02-21 03:37:13,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:13,606 INFO L681 BuchiCegarLoop]: Abstraction has 59 states and 85 transitions. [2022-02-21 03:37:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 85 transitions. [2022-02-21 03:37:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-02-21 03:37:13,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:13,608 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:13,608 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:13,608 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:13,609 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:13,610 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2022-02-21 03:37:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2022-02-21 03:37:13,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:13,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:13,611 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:13,611 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:13,611 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:13,613 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2022-02-21 03:37:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2022-02-21 03:37:13,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:13,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:13,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:13,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:13,614 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:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2022-02-21 03:37:13,615 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2022-02-21 03:37:13,615 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2022-02-21 03:37:13,615 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:37:13,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. [2022-02-21 03:37:13,615 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:37:13,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:13,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:13,616 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:13,616 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:13,616 INFO L791 eck$LassoCheckResult]: Stem: 1767#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); 1752#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~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; 1740#L30 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1741#L80 base2flt_#res#1 := base2flt_~__retres4~0#1; 1757#L81 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; 1770#L30-1 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1749#L80-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 1744#L81-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; 1734#L30-2 assume !(0 == base2flt_~m#1 % 4294967296); 1735#L36-2 assume !(base2flt_~m#1 % 4294967296 < 16777216); 1753#L58-8 [2022-02-21 03:37:13,616 INFO L793 eck$LassoCheckResult]: Loop: 1753#L58-8 assume !false; 1768#L59-2 assume base2flt_~m#1 % 4294967296 >= 33554432; 1769#L60-2 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 1753#L58-8 [2022-02-21 03:37:13,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:13,617 INFO L85 PathProgramCache]: Analyzing trace with hash 877203369, now seen corresponding path program 1 times [2022-02-21 03:37:13,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:13,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074223386] [2022-02-21 03:37:13,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:13,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:13,628 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:13,640 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:13,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:13,641 INFO L85 PathProgramCache]: Analyzing trace with hash 283142, now seen corresponding path program 1 times [2022-02-21 03:37:13,641 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:13,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509886784] [2022-02-21 03:37:13,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:13,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:13,650 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:13,655 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2110176930, now seen corresponding path program 1 times [2022-02-21 03:37:13,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:13,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138340955] [2022-02-21 03:37:13,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:13,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:13,669 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:13,683 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:13,713 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:13,714 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:13,714 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:13,714 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:13,714 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:13,714 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,714 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:13,714 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:13,714 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-2a.c.cil.c_Iteration4_Loop [2022-02-21 03:37:13,714 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:13,714 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:13,715 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:13,719 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:13,814 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:13,814 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:13,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:13,828 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:13,829 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:13,830 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:13,830 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:13,875 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:13,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:13,886 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:13,892 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:13,892 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:13,892 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:13,930 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:13,934 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:13,934 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:13,934 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:13,934 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:13,934 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:13,934 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:13,934 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,934 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:13,934 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:13,934 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-2a.c.cil.c_Iteration4_Loop [2022-02-21 03:37:13,934 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:13,934 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:13,935 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:13,946 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:14,031 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:14,031 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:14,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:14,050 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:14,057 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:14,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:14,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:14,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:14,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:14,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:14,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:14,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:14,065 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:14,067 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:14,067 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:14,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:14,067 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:14,074 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:14,075 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:14,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:14,077 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:14,077 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:14,077 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:14,098 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:14,103 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:14,107 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:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:14,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {2016#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); {2016#unseeded} is VALID [2022-02-21 03:37:14,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {2016#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~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; {2016#unseeded} is VALID [2022-02-21 03:37:14,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {2016#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {2016#unseeded} is VALID [2022-02-21 03:37:14,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {2016#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {2016#unseeded} is VALID [2022-02-21 03:37:14,165 INFO L290 TraceCheckUtils]: 4: Hoare triple {2016#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; {2016#unseeded} is VALID [2022-02-21 03:37:14,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {2016#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {2016#unseeded} is VALID [2022-02-21 03:37:14,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {2016#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {2016#unseeded} is VALID [2022-02-21 03:37:14,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {2016#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; {2016#unseeded} is VALID [2022-02-21 03:37:14,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {2016#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {2016#unseeded} is VALID [2022-02-21 03:37:14,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {2016#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {2016#unseeded} is VALID [2022-02-21 03:37:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:14,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {2019#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {2019#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:14,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {2019#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {2019#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:14,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {2019#(>= 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; {2029#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))))} is VALID [2022-02-21 03:37:14,191 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:14,191 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:14,225 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:14,236 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:14,237 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:14,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,237 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:14,237 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:14,265 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:14,280 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:14,280 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:14,280 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:14,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. cyclomatic complexity: 21 [2022-02-21 03:37:14,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:14,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:14,280 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:14,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:14,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:14,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:14,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 60 transitions. [2022-02-21 03:37:14,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:14,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:14,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:14,282 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 56 transitions. cyclomatic complexity: 21 [2022-02-21 03:37:14,282 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:37:14,282 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:14,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:14,283 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:14,283 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 60 transitions. cyclomatic complexity: 22 [2022-02-21 03:37:14,283 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:37:14,283 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:14,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,283 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:14,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,283 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:14,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,284 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:14,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,284 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:14,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,284 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:14,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,284 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:14,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,285 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:14,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,285 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:14,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,285 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:14,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,285 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:14,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,286 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:14,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,286 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:14,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,286 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:14,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,286 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:14,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,286 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:14,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,286 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:14,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,286 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:14,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,286 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:14,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,286 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:14,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,287 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:14,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,287 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:14,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,287 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:14,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,287 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:14,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,287 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:14,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,288 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:14,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,288 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:14,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,288 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:14,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,288 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:14,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,288 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:14,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,288 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:14,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,288 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:14,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,288 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:14,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,289 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:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,289 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:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,289 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:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,289 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:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,289 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:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,289 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:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,289 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:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,289 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:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,289 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:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,289 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:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,290 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:14,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,290 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:14,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,290 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:14,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,290 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:14,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,290 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:14,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,290 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:14,292 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:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-21 03:37:14,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:14,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:37:14,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 60 transitions. cyclomatic complexity: 22 [2022-02-21 03:37:14,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:14,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 36 states and 52 transitions. [2022-02-21 03:37:14,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-02-21 03:37:14,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-02-21 03:37:14,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 52 transitions. [2022-02-21 03:37:14,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:14,296 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-02-21 03:37:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 52 transitions. [2022-02-21 03:37:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-21 03:37:14,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:14,297 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:14,298 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:14,298 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:14,298 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:14,299 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-02-21 03:37:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2022-02-21 03:37:14,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:14,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:14,299 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:14,299 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:14,300 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:14,310 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-02-21 03:37:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2022-02-21 03:37:14,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:14,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:14,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:14,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:14,310 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:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2022-02-21 03:37:14,311 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-02-21 03:37:14,311 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-02-21 03:37:14,311 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:37:14,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 52 transitions. [2022-02-21 03:37:14,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:14,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:14,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:14,312 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:14,312 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:14,312 INFO L791 eck$LassoCheckResult]: Stem: 2147#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); 2133#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~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; 2121#L30 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 2122#L80 base2flt_#res#1 := base2flt_~__retres4~0#1; 2134#L81 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; 2148#L30-1 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 2130#L80-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 2125#L81-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; 2115#L30-2 assume !(0 == base2flt_~m#1 % 4294967296); 2116#L36-2 assume base2flt_~m#1 % 4294967296 < 16777216; 2135#L48-5 [2022-02-21 03:37:14,312 INFO L793 eck$LassoCheckResult]: Loop: 2135#L48-5 assume !false; 2150#L39-2 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 2146#L48-4 assume base2flt_~m#1 % 4294967296 < 16777216; 2135#L48-5 [2022-02-21 03:37:14,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:14,312 INFO L85 PathProgramCache]: Analyzing trace with hash 877203343, now seen corresponding path program 1 times [2022-02-21 03:37:14,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:14,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901958600] [2022-02-21 03:37:14,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:14,325 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:14,336 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:14,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:14,336 INFO L85 PathProgramCache]: Analyzing trace with hash 257383, now seen corresponding path program 1 times [2022-02-21 03:37:14,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:14,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341359184] [2022-02-21 03:37:14,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:14,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:14,348 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:14,351 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:14,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2110977255, now seen corresponding path program 1 times [2022-02-21 03:37:14,351 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:14,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578612999] [2022-02-21 03:37:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:14,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:14,360 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:14,370 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:14,392 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:14,392 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:14,392 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:14,392 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:14,392 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:14,392 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,392 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:14,392 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:14,392 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-2a.c.cil.c_Iteration5_Loop [2022-02-21 03:37:14,392 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:14,392 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:14,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:14,397 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:14,469 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:14,469 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:14,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:14,472 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:14,473 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:14,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:14,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:14,515 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:14,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:14,517 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:14,518 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:14,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:14,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:14,556 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:14,562 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:14,562 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:14,562 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:14,563 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:14,563 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:14,563 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:14,563 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,563 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:14,563 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:14,563 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-2a.c.cil.c_Iteration5_Loop [2022-02-21 03:37:14,563 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:14,563 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:14,564 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:14,572 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:14,648 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:14,648 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:14,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:14,672 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:14,673 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:14,674 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:14,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:14,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:14,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:14,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:14,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:14,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:14,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:14,696 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:14,698 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:14,698 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:14,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:14,700 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:14,705 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:14,705 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:14,705 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:14,705 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:14,708 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:14,723 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:14,743 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:14,747 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:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:14,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {2322#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); {2322#unseeded} is VALID [2022-02-21 03:37:14,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {2322#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~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; {2322#unseeded} is VALID [2022-02-21 03:37:14,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {2322#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {2322#unseeded} is VALID [2022-02-21 03:37:14,801 INFO L290 TraceCheckUtils]: 3: Hoare triple {2322#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {2322#unseeded} is VALID [2022-02-21 03:37:14,802 INFO L290 TraceCheckUtils]: 4: Hoare triple {2322#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; {2322#unseeded} is VALID [2022-02-21 03:37:14,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {2322#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {2322#unseeded} is VALID [2022-02-21 03:37:14,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {2322#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {2322#unseeded} is VALID [2022-02-21 03:37:14,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {2322#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; {2322#unseeded} is VALID [2022-02-21 03:37:14,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {2322#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {2322#unseeded} is VALID [2022-02-21 03:37:14,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {2322#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {2322#unseeded} is VALID [2022-02-21 03:37:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:14,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {2325#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !false; {2325#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} is VALID [2022-02-21 03:37:14,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {2325#(>= 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; {2370#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} is VALID [2022-02-21 03:37:14,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {2370#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} assume base2flt_~m#1 % 4294967296 < 16777216; {2335#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))) unseeded)} is VALID [2022-02-21 03:37:14,853 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:14,853 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:14,860 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:14,860 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:14,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,860 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:14,860 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:14,892 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:14,892 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:14,892 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:14,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 52 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:14,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:14,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:14,892 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:14,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:14,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:14,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:14,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 56 transitions. [2022-02-21 03:37:14,893 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:14,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:14,893 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 52 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:14,894 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:37:14,894 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:14,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:14,894 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:14,894 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 56 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:14,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 56 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:14,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:14,894 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:37:14,894 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:14,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,894 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:14,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,894 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:14,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,895 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:14,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,895 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:14,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,895 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:14,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,895 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:14,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,895 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:14,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,895 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:14,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,895 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:14,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,895 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:14,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,895 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:14,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,896 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:14,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,896 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:14,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,896 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:14,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,896 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:14,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,896 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:14,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,896 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:14,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,896 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:14,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,896 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:14,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,896 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:14,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,896 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:14,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,897 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:14,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,897 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:14,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,897 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:14,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,897 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:14,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,897 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:14,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,897 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:14,897 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:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-02-21 03:37:14,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:14,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:37:14,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 56 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:14,899 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:14,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2022-02-21 03:37:14,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:37:14,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:37:14,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:37:14,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:14,899 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:14,899 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:14,899 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:14,899 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:37:14,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:37:14,900 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:14,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:14,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:37:14 BoogieIcfgContainer [2022-02-21 03:37:14,919 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:37:14,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:37:14,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:37:14,920 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:37:14,920 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:09" (3/4) ... [2022-02-21 03:37:14,922 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:37:14,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:37:14,926 INFO L158 Benchmark]: Toolchain (without parser) took 6596.14ms. Allocated memory was 96.5MB in the beginning and 146.8MB in the end (delta: 50.3MB). Free memory was 65.9MB in the beginning and 59.2MB in the end (delta: 6.7MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2022-02-21 03:37:14,926 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 51.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:37:14,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.53ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 65.7MB in the beginning and 92.1MB in the end (delta: -26.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:37:14,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.64ms. Allocated memory is still 121.6MB. Free memory was 92.1MB in the beginning and 87.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:37:14,927 INFO L158 Benchmark]: Boogie Preprocessor took 47.03ms. Allocated memory is still 121.6MB. Free memory was 87.9MB in the beginning and 85.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:37:14,927 INFO L158 Benchmark]: RCFGBuilder took 728.16ms. Allocated memory is still 121.6MB. Free memory was 85.4MB in the beginning and 88.6MB in the end (delta: -3.3MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2022-02-21 03:37:14,927 INFO L158 Benchmark]: BuchiAutomizer took 5346.53ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 88.6MB in the beginning and 60.3MB in the end (delta: 28.4MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2022-02-21 03:37:14,927 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 146.8MB. Free memory was 60.3MB in the beginning and 59.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:37:14,930 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 51.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.53ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 65.7MB in the beginning and 92.1MB in the end (delta: -26.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.64ms. Allocated memory is still 121.6MB. Free memory was 92.1MB in the beginning and 87.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.03ms. Allocated memory is still 121.6MB. Free memory was 87.9MB in the beginning and 85.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 728.16ms. Allocated memory is still 121.6MB. Free memory was 85.4MB in the beginning and 88.6MB in the end (delta: -3.3MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 5346.53ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 88.6MB in the beginning and 60.3MB in the end (delta: 28.4MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 146.8MB. Free memory was 60.3MB in the beginning and 59.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 5.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. 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, 465 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 465 mSDsluCounter, 521 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, 469 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: 45ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:37:14,955 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:15,174 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