./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/nested9.i --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/loop-invgen/nested9.i -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 f3ca1fd1ad8fdbcd9efe7b99bc6e3715231417d253ce4ee9bba3d5969472333a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:59:41,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:59:41,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:59:41,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:59:41,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:59:41,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:59:41,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:59:41,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:59:41,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:59:41,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:59:41,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:59:41,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:59:41,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:59:41,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:59:41,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:59:41,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:59:41,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:59:41,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:59:41,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:59:41,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:59:41,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:59:41,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:59:41,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:59:41,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:59:41,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:59:41,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:59:41,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:59:41,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:59:41,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:59:41,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:59:41,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:59:41,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:59:41,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:59:41,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:59:41,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:59:41,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:59:41,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:59:41,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:59:41,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:59:41,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:59:41,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:59:41,452 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:59:41,474 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:59:41,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:59:41,480 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:59:41,480 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:59:41,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:59:41,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:59:41,482 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:59:41,482 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:59:41,482 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:59:41,482 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:59:41,483 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:59:41,483 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:59:41,483 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:59:41,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:59:41,484 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:59:41,484 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:59:41,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:59:41,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:59:41,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:59:41,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:59:41,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:59:41,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:59:41,485 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:59:41,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:59:41,485 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:59:41,485 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:59:41,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:59:41,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:59:41,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:59:41,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:59:41,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:59:41,487 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:59:41,487 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 -> f3ca1fd1ad8fdbcd9efe7b99bc6e3715231417d253ce4ee9bba3d5969472333a [2022-02-21 03:59:41,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:59:41,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:59:41,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:59:41,724 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:59:41,725 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:59:41,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/nested9.i [2022-02-21 03:59:41,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c0cd54d/a79ff7ee6e724715bf15bcf0b958203c/FLAG102904efc [2022-02-21 03:59:42,131 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:59:42,131 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/nested9.i [2022-02-21 03:59:42,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c0cd54d/a79ff7ee6e724715bf15bcf0b958203c/FLAG102904efc [2022-02-21 03:59:42,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c0cd54d/a79ff7ee6e724715bf15bcf0b958203c [2022-02-21 03:59:42,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:59:42,149 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:59:42,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:59:42,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:59:42,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:59:42,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:59:42" (1/1) ... [2022-02-21 03:59:42,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1991ecb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:42, skipping insertion in model container [2022-02-21 03:59:42,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:59:42" (1/1) ... [2022-02-21 03:59:42,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:59:42,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:59:42,351 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/loop-invgen/nested9.i[893,906] [2022-02-21 03:59:42,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:59:42,384 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:59:42,395 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/loop-invgen/nested9.i[893,906] [2022-02-21 03:59:42,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:59:42,418 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:59:42,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:42 WrapperNode [2022-02-21 03:59:42,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:59:42,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:59:42,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:59:42,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:59:42,427 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:59:42" (1/1) ... [2022-02-21 03:59:42,433 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:59:42" (1/1) ... [2022-02-21 03:59:42,454 INFO L137 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2022-02-21 03:59:42,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:59:42,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:59:42,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:59:42,455 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:59:42,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:42" (1/1) ... [2022-02-21 03:59:42,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:42" (1/1) ... [2022-02-21 03:59:42,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:42" (1/1) ... [2022-02-21 03:59:42,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:42" (1/1) ... [2022-02-21 03:59:42,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:42" (1/1) ... [2022-02-21 03:59:42,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:42" (1/1) ... [2022-02-21 03:59:42,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:42" (1/1) ... [2022-02-21 03:59:42,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:59:42,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:59:42,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:59:42,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:59:42,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:42" (1/1) ... [2022-02-21 03:59:42,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:42,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:42,525 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:59:42,545 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:59:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:59:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:59:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:59:42,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:59:42,602 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:59:42,604 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:59:42,774 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:59:42,779 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:59:42,779 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 03:59:42,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:59:42 BoogieIcfgContainer [2022-02-21 03:59:42,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:59:42,793 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:59:42,793 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:59:42,795 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:59:42,796 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:59:42,796 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:59:42" (1/3) ... [2022-02-21 03:59:42,797 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@485c931d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:59:42, skipping insertion in model container [2022-02-21 03:59:42,797 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:59:42,797 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:42" (2/3) ... [2022-02-21 03:59:42,797 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@485c931d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:59:42, skipping insertion in model container [2022-02-21 03:59:42,797 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:59:42,797 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:59:42" (3/3) ... [2022-02-21 03:59:42,798 INFO L388 chiAutomizerObserver]: Analyzing ICFG nested9.i [2022-02-21 03:59:42,851 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:59:42,863 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:59:42,863 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:59:42,863 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:59:42,864 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:59:42,864 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:59:42,864 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:59:42,864 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:59:42,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 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:59:42,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-02-21 03:59:42,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:42,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:42,905 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:42,905 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:59:42,905 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:59:42,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 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:59:42,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-02-21 03:59:42,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:42,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:42,915 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:42,915 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:59:42,921 INFO L791 eck$LassoCheckResult]: Stem: 4#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(9, 2);~__BLAST_NONDET~0 := 0; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 5#L30true assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 8#L31true assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 10#L32true assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 7#L33true assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 6#L33-1true main_~i~0#1 := 0; 22#L34-3true [2022-02-21 03:59:42,922 INFO L793 eck$LassoCheckResult]: Loop: 22#L34-3true assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 13#L35-3true assume !true; 12#L34-2true main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 22#L34-3true [2022-02-21 03:59:42,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:42,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907757, now seen corresponding path program 1 times [2022-02-21 03:59:42,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:42,939 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014260548] [2022-02-21 03:59:42,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:42,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:43,031 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:43,067 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:43,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:43,075 INFO L85 PathProgramCache]: Analyzing trace with hash 62657, now seen corresponding path program 1 times [2022-02-21 03:59:43,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:43,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777532399] [2022-02-21 03:59:43,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:43,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:43,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {26#true} is VALID [2022-02-21 03:59:43,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-02-21 03:59:43,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {27#false} is VALID [2022-02-21 03:59:43,123 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:59:43,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:59:43,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777532399] [2022-02-21 03:59:43,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777532399] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:59:43,124 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:59:43,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:59:43,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164715560] [2022-02-21 03:59:43,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:59:43,131 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:59:43,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:59:43,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:59:43,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:59:43,158 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 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 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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:59:43,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:59:43,197 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-21 03:59:43,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:59:43,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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:59:43,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:43,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2022-02-21 03:59:43,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:59:43,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 17 transitions. [2022-02-21 03:59:43,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 03:59:43,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 03:59:43,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2022-02-21 03:59:43,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:59:43,222 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-21 03:59:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2022-02-21 03:59:43,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-21 03:59:43,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:59:43,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 17 transitions. Second operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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:59:43,241 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 17 transitions. Second operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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:59:43,242 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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:59:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:59:43,244 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:59:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:59:43,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:43,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:43,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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 15 states and 17 transitions. [2022-02-21 03:59:43,245 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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 15 states and 17 transitions. [2022-02-21 03:59:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:59:43,247 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:59:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:59:43,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:43,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:43,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:59:43,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:59:43,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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:59:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-21 03:59:43,250 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-21 03:59:43,250 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-21 03:59:43,251 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:59:43,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:59:43,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:59:43,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:43,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:43,255 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:43,255 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:59:43,256 INFO L791 eck$LassoCheckResult]: Stem: 48#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(9, 2);~__BLAST_NONDET~0 := 0; 49#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 50#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 51#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 55#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 54#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 52#L33-1 main_~i~0#1 := 0; 53#L34-3 [2022-02-21 03:59:43,257 INFO L793 eck$LassoCheckResult]: Loop: 53#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 60#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 59#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 53#L34-3 [2022-02-21 03:59:43,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907757, now seen corresponding path program 2 times [2022-02-21 03:59:43,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:43,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468933324] [2022-02-21 03:59:43,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:43,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:43,288 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:43,303 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:43,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:43,304 INFO L85 PathProgramCache]: Analyzing trace with hash 61789, now seen corresponding path program 1 times [2022-02-21 03:59:43,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:43,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929085934] [2022-02-21 03:59:43,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:43,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:43,324 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:43,329 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:43,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:43,330 INFO L85 PathProgramCache]: Analyzing trace with hash 763900017, now seen corresponding path program 1 times [2022-02-21 03:59:43,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:43,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741630046] [2022-02-21 03:59:43,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:43,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:43,353 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:43,372 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:43,417 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:43,418 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:43,418 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:43,418 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:43,418 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:59:43,418 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:43,418 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:43,418 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:43,419 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration2_Loop [2022-02-21 03:59:43,419 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:43,419 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:43,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:43,436 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:59:43,509 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:43,509 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:59:43,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:43,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:43,536 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:59:43,553 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:43,553 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:43,563 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:59:43,575 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:59:43,575 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:59:43,595 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:59:43,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:43,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:43,598 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:59:43,599 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:59:43,601 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:43,601 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:43,638 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:59:43,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:43,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:43,640 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:59:43,641 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:59:43,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:59:43,643 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:43,827 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:59:43,832 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:59:43,835 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:43,835 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:43,835 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:43,835 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:43,835 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:59:43,835 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:43,835 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:43,835 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:43,835 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration2_Loop [2022-02-21 03:59:43,835 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:43,835 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:43,836 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:59:43,855 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:59:43,922 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:43,925 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:59:43,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:43,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:43,929 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:59:43,930 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:59:43,932 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:59:43,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:43,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:43,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:43,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:43,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:43,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:43,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:43,977 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:59:43,981 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:59:43,981 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:59:43,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:43,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:43,984 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:59:44,020 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:59:44,020 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:59:44,021 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:59:44,021 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2022-02-21 03:59:44,042 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:59:44,047 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:59:44,061 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:59:44,071 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1;" "assume !(main_~j~0#1 < 3 * main_~i~0#1);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2022-02-21 03:59:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:44,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:44,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:59:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:44,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:44,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {102#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(9, 2);~__BLAST_NONDET~0 := 0; {102#unseeded} is VALID [2022-02-21 03:59:44,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {102#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {102#unseeded} is VALID [2022-02-21 03:59:44,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {102#unseeded} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {102#unseeded} is VALID [2022-02-21 03:59:44,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {102#unseeded} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {102#unseeded} is VALID [2022-02-21 03:59:44,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {102#unseeded} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {102#unseeded} is VALID [2022-02-21 03:59:44,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {102#unseeded} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {102#unseeded} is VALID [2022-02-21 03:59:44,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {102#unseeded} main_~i~0#1 := 0; {102#unseeded} is VALID [2022-02-21 03:59:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:44,130 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:59:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:44,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:44,178 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:59:44,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 1))} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {138#(and (<= |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 1)))} is VALID [2022-02-21 03:59:44,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#(and (<= |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 1)))} assume !(main_~j~0#1 < 3 * main_~i~0#1); {142#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 1)))} is VALID [2022-02-21 03:59:44,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 1)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {115#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 1))))} is VALID [2022-02-21 03:59:44,237 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:59:44,238 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:59:44,245 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:59:44,247 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:59:44,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,249 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:59:44,249 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 3 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:59:44,342 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 3. 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 40 states and 50 transitions. Complement of second has 8 states. [2022-02-21 03:59:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:59:44,342 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:44,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. cyclomatic complexity: 3 [2022-02-21 03:59:44,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:44,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:44,342 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:59:44,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:59:44,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:44,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:44,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2022-02-21 03:59:44,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:59:44,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:44,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:44,346 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 17 transitions. cyclomatic complexity: 3 [2022-02-21 03:59:44,347 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:59:44,348 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:59:44,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:59:44,349 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:59:44,349 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 50 transitions. cyclomatic complexity: 12 [2022-02-21 03:59:44,351 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 03:59:44,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:59:44,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,351 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:59:44,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:59:44,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:44,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,352 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 3 letters. [2022-02-21 03:59:44,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:44,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:44,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,352 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 4 letters. [2022-02-21 03:59:44,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:44,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:59:44,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,353 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 40 letters. Loop has 40 letters. [2022-02-21 03:59:44,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:59:44,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:59:44,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,353 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 15 letters. [2022-02-21 03:59:44,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:59:44,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:59:44,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,353 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 5 letters. Loop has 5 letters. [2022-02-21 03:59:44,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:59:44,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:59:44,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,354 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:59:44,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:59:44,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:59:44,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,354 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:59:44,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:59:44,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:44,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,355 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 4 letters. [2022-02-21 03:59:44,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:44,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:59:44,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,355 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:59:44,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:59:44,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:59:44,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,356 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:59:44,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:59:44,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:59:44,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,357 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:59:44,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:59:44,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:59:44,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,357 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 4 letters. [2022-02-21 03:59:44,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:59:44,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:59:44,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,358 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 4 letters. [2022-02-21 03:59:44,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:59:44,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:44,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,358 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 3 letters. [2022-02-21 03:59:44,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:44,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:59:44,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,359 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 4 letters. [2022-02-21 03:59:44,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:59:44,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:59:44,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,359 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:59:44,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:59:44,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:59:44,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,359 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 6 letters. [2022-02-21 03:59:44,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:59:44,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:59:44,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,360 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 4 letters. [2022-02-21 03:59:44,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:59:44,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:59:44,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,360 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 4 letters. [2022-02-21 03:59:44,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:59:44,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:44,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,361 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 4 letters. [2022-02-21 03:59:44,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:44,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:44,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,361 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 4 letters. [2022-02-21 03:59:44,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:44,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:59:44,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,362 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 6 letters. [2022-02-21 03:59:44,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:59:44,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:59:44,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,362 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 4 letters. [2022-02-21 03:59:44,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:59:44,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:59:44,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,363 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:59:44,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:59:44,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:59:44,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,363 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 4 letters. [2022-02-21 03:59:44,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:59:44,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:59:44,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,364 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 6 letters. [2022-02-21 03:59:44,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:59:44,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:59:44,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,364 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:59:44,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:59:44,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:59:44,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,365 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 6 letters. [2022-02-21 03:59:44,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 50 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:59:44,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,365 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:44,366 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:59:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-02-21 03:59:44,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:59:44,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:59:44,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:59:44,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:44,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 50 transitions. cyclomatic complexity: 12 [2022-02-21 03:59:44,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:59:44,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 48 transitions. [2022-02-21 03:59:44,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-02-21 03:59:44,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-02-21 03:59:44,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2022-02-21 03:59:44,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:59:44,370 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-02-21 03:59:44,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2022-02-21 03:59:44,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2022-02-21 03:59:44,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:59:44,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states and 48 transitions. Second operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 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:59:44,372 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states and 48 transitions. Second operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 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:59:44,372 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 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:59:44,372 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:44,374 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-02-21 03:59:44,374 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-02-21 03:59:44,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:44,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:44,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 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 48 transitions. [2022-02-21 03:59:44,375 INFO L87 Difference]: Start difference. First operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 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 48 transitions. [2022-02-21 03:59:44,375 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:44,377 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-02-21 03:59:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-02-21 03:59:44,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:44,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:44,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:59:44,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:59:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 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:59:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-02-21 03:59:44,378 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-02-21 03:59:44,378 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-02-21 03:59:44,378 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:59:44,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2022-02-21 03:59:44,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-02-21 03:59:44,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:44,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:44,379 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:44,379 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:59:44,379 INFO L791 eck$LassoCheckResult]: Stem: 199#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(9, 2);~__BLAST_NONDET~0 := 0; 200#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 201#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 202#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 206#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 205#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 203#L33-1 main_~i~0#1 := 0; 204#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 217#L35-3 [2022-02-21 03:59:44,379 INFO L793 eck$LassoCheckResult]: Loop: 217#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 207#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 209#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 223#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 213#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 214#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 217#L35-3 [2022-02-21 03:59:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash 179565651, now seen corresponding path program 1 times [2022-02-21 03:59:44,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:44,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203506291] [2022-02-21 03:59:44,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:44,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:44,389 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:44,394 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:44,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:44,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2077096969, now seen corresponding path program 1 times [2022-02-21 03:59:44,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:44,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124059346] [2022-02-21 03:59:44,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:44,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:44,403 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:44,407 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:44,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:44,407 INFO L85 PathProgramCache]: Analyzing trace with hash -696653093, now seen corresponding path program 1 times [2022-02-21 03:59:44,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:44,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865177147] [2022-02-21 03:59:44,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:44,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:44,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#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(9, 2);~__BLAST_NONDET~0 := 0; {377#true} is VALID [2022-02-21 03:59:44,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {377#true} is VALID [2022-02-21 03:59:44,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {377#true} is VALID [2022-02-21 03:59:44,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {377#true} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {377#true} is VALID [2022-02-21 03:59:44,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {377#true} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {377#true} is VALID [2022-02-21 03:59:44,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#true} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {377#true} is VALID [2022-02-21 03:59:44,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {377#true} main_~i~0#1 := 0; {379#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:44,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {379#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {380#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:59:44,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {380#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {378#false} is VALID [2022-02-21 03:59:44,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {378#false} assume !(main_~k~0#1 < main_~j~0#1); {378#false} is VALID [2022-02-21 03:59:44,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {378#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {378#false} is VALID [2022-02-21 03:59:44,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {378#false} assume !(main_~j~0#1 < 3 * main_~i~0#1); {378#false} is VALID [2022-02-21 03:59:44,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {378#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {378#false} is VALID [2022-02-21 03:59:44,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {378#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {378#false} is VALID [2022-02-21 03:59:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:44,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:59:44,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865177147] [2022-02-21 03:59:44,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865177147] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:59:44,451 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:59:44,451 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:59:44,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079399327] [2022-02-21 03:59:44,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:59:44,492 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:44,492 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:44,492 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:44,492 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:44,492 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:59:44,492 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:44,492 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:44,492 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:44,492 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration3_Loop [2022-02-21 03:59:44,492 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:44,492 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:44,493 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:59:44,510 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:59:44,512 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:59:44,566 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:44,566 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:59:44,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:44,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:44,568 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:59:44,569 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:59:44,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:44,571 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:44,616 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:59:44,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:44,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:44,636 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:59:44,637 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:59:44,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:59:44,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:44,879 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:59:44,924 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:59:44,924 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:44,924 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:44,924 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:44,924 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:44,925 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:59:44,925 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:44,925 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:44,925 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:44,925 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration3_Loop [2022-02-21 03:59:44,925 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:44,925 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:44,926 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:59:44,944 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:59:44,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:59:45,010 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:45,010 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:59:45,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:45,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:45,015 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:59:45,017 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:59:45,018 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:59:45,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:45,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:45,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:45,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:45,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:45,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:45,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:45,043 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:59:45,047 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:59:45,047 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:59:45,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:45,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:45,048 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:59:45,049 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:59:45,051 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:59:45,051 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:59:45,051 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:59:45,051 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2022-02-21 03:59:45,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:59:45,072 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:59:45,076 INFO L390 LassoCheck]: Loop: "assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1;" "assume !(main_~k~0#1 < main_~j~0#1);" "main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~j~0#1 < 3 * main_~i~0#1);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1;" [2022-02-21 03:59:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:45,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:45,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:59:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:45,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:45,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {381#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(9, 2);~__BLAST_NONDET~0 := 0; {381#unseeded} is VALID [2022-02-21 03:59:45,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {381#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {381#unseeded} is VALID [2022-02-21 03:59:45,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {381#unseeded} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {381#unseeded} is VALID [2022-02-21 03:59:45,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {381#unseeded} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {381#unseeded} is VALID [2022-02-21 03:59:45,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {381#unseeded} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {381#unseeded} is VALID [2022-02-21 03:59:45,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {381#unseeded} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {381#unseeded} is VALID [2022-02-21 03:59:45,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {381#unseeded} main_~i~0#1 := 0; {381#unseeded} is VALID [2022-02-21 03:59:45,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {381#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {381#unseeded} is VALID [2022-02-21 03:59:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:45,128 WARN L261 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:59:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:45,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:45,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {384#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {420#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:45,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !(main_~k~0#1 < main_~j~0#1); {424#(and (< |ULTIMATE.start_main_~n~0#1| (+ oldRank0 (* 3 |ULTIMATE.start_main_~i~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~i~0#1| oldRank0)))} is VALID [2022-02-21 03:59:45,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {424#(and (< |ULTIMATE.start_main_~n~0#1| (+ oldRank0 (* 3 |ULTIMATE.start_main_~i~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~i~0#1| oldRank0)))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {424#(and (< |ULTIMATE.start_main_~n~0#1| (+ oldRank0 (* 3 |ULTIMATE.start_main_~i~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~i~0#1| oldRank0)))} is VALID [2022-02-21 03:59:45,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {424#(and (< |ULTIMATE.start_main_~n~0#1| (+ oldRank0 (* 3 |ULTIMATE.start_main_~i~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~i~0#1| oldRank0)))} assume !(main_~j~0#1 < 3 * main_~i~0#1); {424#(and (< |ULTIMATE.start_main_~n~0#1| (+ oldRank0 (* 3 |ULTIMATE.start_main_~i~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~i~0#1| oldRank0)))} is VALID [2022-02-21 03:59:45,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {424#(and (< |ULTIMATE.start_main_~n~0#1| (+ oldRank0 (* 3 |ULTIMATE.start_main_~i~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~i~0#1| oldRank0)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {434#(and (< (div (+ (- 1) oldRank0 (* (- 1) |ULTIMATE.start_main_~n~0#1|)) (- 3)) |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| oldRank0)))} is VALID [2022-02-21 03:59:45,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#(and (< (div (+ (- 1) oldRank0 (* (- 1) |ULTIMATE.start_main_~n~0#1|)) (- 3)) |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| oldRank0)))} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {394#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|))))} is VALID [2022-02-21 03:59:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:45,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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:59:45,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:45,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 03:59:45,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,251 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:59:45,251 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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:59:45,434 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 136 states and 169 transitions. Complement of second has 13 states. [2022-02-21 03:59:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 03:59:45,434 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:45,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. cyclomatic complexity: 9 [2022-02-21 03:59:45,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:45,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:45,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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:59:45,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:59:45,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:45,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:45,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 169 transitions. [2022-02-21 03:59:45,438 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2022-02-21 03:59:45,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:45,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:45,438 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 35 transitions. cyclomatic complexity: 9 [2022-02-21 03:59:45,439 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:59:45,439 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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:59:45,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:59:45,440 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:59:45,440 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 136 states and 169 transitions. cyclomatic complexity: 41 [2022-02-21 03:59:45,442 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 30 examples of accepted words. [2022-02-21 03:59:45,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:59:45,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 03:59:45,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:59:45,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 5 letters. [2022-02-21 03:59:45,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:59:45,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 1 letters. Loop has 5 letters. [2022-02-21 03:59:45,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 7 letters. [2022-02-21 03:59:45,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:45,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 10 letters. Loop has 7 letters. [2022-02-21 03:59:45,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 136 letters. Loop has 136 letters. [2022-02-21 03:59:45,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 136 letters. Loop has 136 letters. [2022-02-21 03:59:45,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 136 letters. Loop has 136 letters. [2022-02-21 03:59:45,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:59:45,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:59:45,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:59:45,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:59:45,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:45,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:59:45,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:45,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:45,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:45,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:59:45,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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:59:45,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:59:45,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:59:45,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 03:59:45,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:59:45,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:59:45,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 03:59:45,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:59:45,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:59:45,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 03:59:45,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:59:45,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:59:45,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:45,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:59:45,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:59:45,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:45,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:59:45,476 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:59:45,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:59:45,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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:59:45,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:59:45,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:59:45,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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:59:45,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:59:45,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 5 letters. [2022-02-21 03:59:45,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:59:45,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 1 letters. Loop has 5 letters. [2022-02-21 03:59:45,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:59:45,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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:59:45,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:59:45,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:59:45,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:45,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:59:45,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:59:45,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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:59:45,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:59:45,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:59:45,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 03:59:45,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:59:45,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:59:45,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:45,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:59:45,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:59:45,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:45,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:59:45,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:59:45,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 03:59:45,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:59:45,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:59:45,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 03:59:45,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:59:45,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:59:45,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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:59:45,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:59:45,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:45,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:45,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:45,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:59:45,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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:59:45,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:59:45,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:45,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:45,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:45,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:45,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:45,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:45,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:59:45,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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:59:45,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:59:45,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:45,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:45,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:45,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:45,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:45,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:45,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:45,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:45,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:45,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:59:45,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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:59:45,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:59:45,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:59:45,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:45,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:59:45,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:45,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:45,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:45,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:59:45,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:45,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:59:45,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:45,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:45,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:45,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:59:45,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:45,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:59:45,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:59:45,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:45,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:59:45,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:59:45,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:45,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:59:45,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 7 letters. [2022-02-21 03:59:45,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:45,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 10 letters. Loop has 7 letters. [2022-02-21 03:59:45,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:45,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:45,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:45,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:45,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:45,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:45,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:45,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:45,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:45,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:45,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:45,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 169 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:45,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,496 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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:59:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-02-21 03:59:45,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:59:45,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:59:45,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 8 letters. Loop has 12 letters. [2022-02-21 03:59:45,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:45,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 169 transitions. cyclomatic complexity: 41 [2022-02-21 03:59:45,501 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2022-02-21 03:59:45,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 115 states and 145 transitions. [2022-02-21 03:59:45,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-02-21 03:59:45,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2022-02-21 03:59:45,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 145 transitions. [2022-02-21 03:59:45,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:59:45,503 INFO L681 BuchiCegarLoop]: Abstraction has 115 states and 145 transitions. [2022-02-21 03:59:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 145 transitions. [2022-02-21 03:59:45,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 81. [2022-02-21 03:59:45,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:59:45,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states and 145 transitions. Second operand has 81 states, 81 states have (on average 1.308641975308642) internal successors, (106), 80 states have internal predecessors, (106), 0 states have call successors, (0), 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:59:45,508 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states and 145 transitions. Second operand has 81 states, 81 states have (on average 1.308641975308642) internal successors, (106), 80 states have internal predecessors, (106), 0 states have call successors, (0), 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:59:45,508 INFO L87 Difference]: Start difference. First operand 115 states and 145 transitions. Second operand has 81 states, 81 states have (on average 1.308641975308642) internal successors, (106), 80 states have internal predecessors, (106), 0 states have call successors, (0), 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:59:45,508 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:45,511 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2022-02-21 03:59:45,511 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2022-02-21 03:59:45,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:45,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:45,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 81 states have (on average 1.308641975308642) internal successors, (106), 80 states have internal predecessors, (106), 0 states have call successors, (0), 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 115 states and 145 transitions. [2022-02-21 03:59:45,512 INFO L87 Difference]: Start difference. First operand has 81 states, 81 states have (on average 1.308641975308642) internal successors, (106), 80 states have internal predecessors, (106), 0 states have call successors, (0), 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 115 states and 145 transitions. [2022-02-21 03:59:45,512 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:45,516 INFO L93 Difference]: Finished difference Result 119 states and 153 transitions. [2022-02-21 03:59:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 153 transitions. [2022-02-21 03:59:45,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:45,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:45,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:59:45,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:59:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.308641975308642) internal successors, (106), 80 states have internal predecessors, (106), 0 states have call successors, (0), 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:59:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2022-02-21 03:59:45,518 INFO L704 BuchiCegarLoop]: Abstraction has 81 states and 106 transitions. [2022-02-21 03:59:45,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:59:45,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:59:45,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:59:45,519 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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:59:45,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:59:45,552 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-21 03:59:45,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:59:45,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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:59:45,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:45,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2022-02-21 03:59:45,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-02-21 03:59:45,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 36 transitions. [2022-02-21 03:59:45,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 03:59:45,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:59:45,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2022-02-21 03:59:45,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:59:45,563 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-21 03:59:45,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2022-02-21 03:59:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-02-21 03:59:45,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:59:45,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 36 transitions. Second operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 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:59:45,564 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 36 transitions. Second operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 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:59:45,565 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 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:59:45,565 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:45,565 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-21 03:59:45,566 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-21 03:59:45,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:45,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:45,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 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 30 states and 36 transitions. [2022-02-21 03:59:45,566 INFO L87 Difference]: Start difference. First operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 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 30 states and 36 transitions. [2022-02-21 03:59:45,566 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:45,567 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-21 03:59:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-21 03:59:45,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:45,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:45,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:59:45,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:59:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 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:59:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-02-21 03:59:45,568 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-02-21 03:59:45,568 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-02-21 03:59:45,568 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:59:45,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2022-02-21 03:59:45,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-02-21 03:59:45,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:45,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:45,568 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:45,569 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:59:45,569 INFO L791 eck$LassoCheckResult]: Stem: 1050#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(9, 2);~__BLAST_NONDET~0 := 0; 1051#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 1052#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 1053#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 1057#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 1056#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 1054#L33-1 main_~i~0#1 := 0; 1055#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1069#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 1066#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1067#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1068#L35-3 [2022-02-21 03:59:45,569 INFO L793 eck$LassoCheckResult]: Loop: 1068#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 1058#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 1060#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1074#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 1064#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1065#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1068#L35-3 [2022-02-21 03:59:45,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:45,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2088903217, now seen corresponding path program 2 times [2022-02-21 03:59:45,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:45,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748779887] [2022-02-21 03:59:45,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:45,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:45,579 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:45,584 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:45,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:45,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2077096969, now seen corresponding path program 2 times [2022-02-21 03:59:45,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:45,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290162952] [2022-02-21 03:59:45,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:45,589 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:45,602 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:45,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:45,603 INFO L85 PathProgramCache]: Analyzing trace with hash -669865, now seen corresponding path program 2 times [2022-02-21 03:59:45,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:45,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718457642] [2022-02-21 03:59:45,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:45,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:45,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {1213#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(9, 2);~__BLAST_NONDET~0 := 0; {1213#true} is VALID [2022-02-21 03:59:45,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {1213#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {1213#true} is VALID [2022-02-21 03:59:45,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {1213#true} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {1213#true} is VALID [2022-02-21 03:59:45,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {1213#true} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {1213#true} is VALID [2022-02-21 03:59:45,631 INFO L290 TraceCheckUtils]: 4: Hoare triple {1213#true} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {1213#true} is VALID [2022-02-21 03:59:45,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {1213#true} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {1213#true} is VALID [2022-02-21 03:59:45,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {1213#true} main_~i~0#1 := 0; {1213#true} is VALID [2022-02-21 03:59:45,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {1213#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {1213#true} is VALID [2022-02-21 03:59:45,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {1213#true} assume !(main_~j~0#1 < 3 * main_~i~0#1); {1213#true} is VALID [2022-02-21 03:59:45,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {1213#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1213#true} is VALID [2022-02-21 03:59:45,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {1213#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {1215#(<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:59:45,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {1215#(<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {1216#(<= (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:59:45,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {1216#(<= (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|)} assume !(main_~k~0#1 < main_~j~0#1); {1214#false} is VALID [2022-02-21 03:59:45,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {1214#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1214#false} is VALID [2022-02-21 03:59:45,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {1214#false} assume !(main_~j~0#1 < 3 * main_~i~0#1); {1214#false} is VALID [2022-02-21 03:59:45,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {1214#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1214#false} is VALID [2022-02-21 03:59:45,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {1214#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {1214#false} is VALID [2022-02-21 03:59:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:59:45,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:59:45,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718457642] [2022-02-21 03:59:45,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718457642] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:59:45,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:59:45,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:59:45,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151040617] [2022-02-21 03:59:45,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:59:45,669 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:45,669 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:45,670 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:45,670 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:45,670 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:59:45,670 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:45,670 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:45,670 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:45,670 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration4_Loop [2022-02-21 03:59:45,670 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:45,670 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:45,671 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:59:45,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:45,685 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:59:45,758 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:45,758 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:59:45,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:45,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:45,760 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:59:45,766 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:45,766 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:45,767 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:59:45,791 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:59:45,792 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:59:45,807 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:59:45,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:45,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:45,809 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:59:45,810 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:59:45,812 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:45,812 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:45,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 03:59:45,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:45,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:45,842 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:59:45,843 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:59:45,844 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:59:45,844 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:46,119 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:59:46,124 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:59:46,125 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:46,125 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:46,125 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:46,125 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:46,125 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:59:46,125 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:46,125 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:46,125 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:46,125 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration4_Loop [2022-02-21 03:59:46,125 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:46,125 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:46,126 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:59:46,137 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:59:46,151 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:59:46,223 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:46,223 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:59:46,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:46,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:46,225 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:59:46,226 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:59:46,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:59:46,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:46,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:46,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:46,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:46,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:46,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:46,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:46,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:59:46,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 03:59:46,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:46,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:46,275 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:59:46,276 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:59:46,277 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:59:46,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:46,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:46,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:46,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:46,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:46,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:46,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:46,291 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:59:46,298 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:59:46,298 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:59:46,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:46,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:46,300 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:59:46,309 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:59:46,313 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:59:46,313 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:59:46,313 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:59:46,314 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2022-02-21 03:59:46,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 03:59:46,347 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:59:46,351 INFO L390 LassoCheck]: Loop: "assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1;" "assume !(main_~k~0#1 < main_~j~0#1);" "main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~j~0#1 < 3 * main_~i~0#1);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1;" [2022-02-21 03:59:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:46,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:46,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:59:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:46,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:46,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {1217#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(9, 2);~__BLAST_NONDET~0 := 0; {1217#unseeded} is VALID [2022-02-21 03:59:46,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {1217#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {1217#unseeded} is VALID [2022-02-21 03:59:46,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {1217#unseeded} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {1217#unseeded} is VALID [2022-02-21 03:59:46,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {1217#unseeded} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {1217#unseeded} is VALID [2022-02-21 03:59:46,409 INFO L290 TraceCheckUtils]: 4: Hoare triple {1217#unseeded} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {1217#unseeded} is VALID [2022-02-21 03:59:46,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {1217#unseeded} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {1217#unseeded} is VALID [2022-02-21 03:59:46,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {1217#unseeded} main_~i~0#1 := 0; {1217#unseeded} is VALID [2022-02-21 03:59:46,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {1217#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {1217#unseeded} is VALID [2022-02-21 03:59:46,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {1217#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {1217#unseeded} is VALID [2022-02-21 03:59:46,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {1217#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1217#unseeded} is VALID [2022-02-21 03:59:46,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {1217#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {1217#unseeded} is VALID [2022-02-21 03:59:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:46,418 WARN L261 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:59:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:46,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:46,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {1220#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) 1))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {1265#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) 1)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:46,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {1265#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) 1)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !(main_~k~0#1 < main_~j~0#1); {1269#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) 1)) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:46,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {1269#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) 1)) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1273#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) 1)) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-21 03:59:46,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {1273#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) 1)) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume !(main_~j~0#1 < 3 * main_~i~0#1); {1277#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) 1)) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) 1))} is VALID [2022-02-21 03:59:46,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {1277#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) 1)) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1281#(and (<= 1 oldRank0) (<= 2 (+ |ULTIMATE.start_main_~i~0#1| oldRank0)))} is VALID [2022-02-21 03:59:46,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {1281#(and (<= 1 oldRank0) (<= 2 (+ |ULTIMATE.start_main_~i~0#1| oldRank0)))} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {1230#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) 1))))} is VALID [2022-02-21 03:59:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:46,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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:59:46,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:46,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 03:59:46,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,583 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2022-02-21 03:59:46,583 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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:59:46,785 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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 105 states and 134 transitions. Complement of second has 14 states. [2022-02-21 03:59:46,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2022-02-21 03:59:46,785 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:46,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. cyclomatic complexity: 8 [2022-02-21 03:59:46,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:46,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:46,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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:59:46,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:59:46,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:46,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:46,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 134 transitions. [2022-02-21 03:59:46,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2022-02-21 03:59:46,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:46,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:46,787 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 35 transitions. cyclomatic complexity: 8 [2022-02-21 03:59:46,787 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:59:46,787 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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:59:46,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:59:46,788 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:59:46,788 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 105 states and 134 transitions. cyclomatic complexity: 33 [2022-02-21 03:59:46,789 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 21 examples of accepted words. [2022-02-21 03:59:46,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:59:46,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 03:59:46,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:59:46,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:59:46,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 03:59:46,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:59:46,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:59:46,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 10 letters. [2022-02-21 03:59:46,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:59:46,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 105 letters. Loop has 105 letters. [2022-02-21 03:59:46,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 105 letters. Loop has 105 letters. [2022-02-21 03:59:46,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 105 letters. Loop has 105 letters. [2022-02-21 03:59:46,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:59:46,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:59:46,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:59:46,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:59:46,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 8 letters. [2022-02-21 03:59:46,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:59:46,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:59:46,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:46,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:59:46,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:59:46,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:59:46,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:59:46,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:59:46,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:59:46,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:59:46,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:59:46,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:46,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:59:46,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:59:46,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:59:46,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:59:46,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:59:46,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 03:59:46,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:59:46,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:59:46,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 03:59:46,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:59:46,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:59:46,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 03:59:46,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:59:46,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:59:46,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:46,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:59:46,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:59:46,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 6 letters. [2022-02-21 03:59:46,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:59:46,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:46,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:46,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:46,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:46,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:46,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:46,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:46,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:46,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:46,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:46,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:46,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:46,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 10 letters. [2022-02-21 03:59:46,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 10 letters. [2022-02-21 03:59:46,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 20 letters. Loop has 10 letters. [2022-02-21 03:59:46,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 10 letters. [2022-02-21 03:59:46,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 10 letters. [2022-02-21 03:59:46,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 20 letters. Loop has 10 letters. [2022-02-21 03:59:46,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:46,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:46,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:46,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:59:46,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:59:46,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:59:46,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:46,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:46,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:46,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:46,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:46,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:46,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:59:46,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:59:46,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:59:46,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:46,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:46,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:46,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:59:46,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:59:46,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:59:46,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:59:46,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:46,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:59:46,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:59:46,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:46,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:59:46,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:46,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:46,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:46,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:59:46,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:59:46,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:59:46,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:46,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:46,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:46,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:59:46,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 10 letters. [2022-02-21 03:59:46,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:59:46,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 10 letters. [2022-02-21 03:59:46,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 10 letters. [2022-02-21 03:59:46,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 10 letters. [2022-02-21 03:59:46,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:46,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:46,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 105 states and 134 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:46,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,851 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:46,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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:59:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-02-21 03:59:46,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:59:46,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:59:46,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 11 letters. Loop has 12 letters. [2022-02-21 03:59:46,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:46,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 134 transitions. cyclomatic complexity: 33 [2022-02-21 03:59:46,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2022-02-21 03:59:46,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 103 states and 132 transitions. [2022-02-21 03:59:46,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-02-21 03:59:46,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-02-21 03:59:46,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 132 transitions. [2022-02-21 03:59:46,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:59:46,871 INFO L681 BuchiCegarLoop]: Abstraction has 103 states and 132 transitions. [2022-02-21 03:59:46,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 132 transitions. [2022-02-21 03:59:46,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 65. [2022-02-21 03:59:46,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:59:46,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states and 132 transitions. Second operand has 65 states, 65 states have (on average 1.323076923076923) internal successors, (86), 64 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:46,880 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states and 132 transitions. Second operand has 65 states, 65 states have (on average 1.323076923076923) internal successors, (86), 64 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:46,881 INFO L87 Difference]: Start difference. First operand 103 states and 132 transitions. Second operand has 65 states, 65 states have (on average 1.323076923076923) internal successors, (86), 64 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:46,881 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:46,897 INFO L93 Difference]: Finished difference Result 106 states and 137 transitions. [2022-02-21 03:59:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2022-02-21 03:59:46,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:46,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:46,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 65 states have (on average 1.323076923076923) internal successors, (86), 64 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 103 states and 132 transitions. [2022-02-21 03:59:46,899 INFO L87 Difference]: Start difference. First operand has 65 states, 65 states have (on average 1.323076923076923) internal successors, (86), 64 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 103 states and 132 transitions. [2022-02-21 03:59:46,900 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:46,903 INFO L93 Difference]: Finished difference Result 109 states and 142 transitions. [2022-02-21 03:59:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 142 transitions. [2022-02-21 03:59:46,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:46,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:46,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:59:46,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:59:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.323076923076923) internal successors, (86), 64 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2022-02-21 03:59:46,907 INFO L704 BuchiCegarLoop]: Abstraction has 65 states and 86 transitions. [2022-02-21 03:59:46,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:59:46,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:59:46,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:59:46,908 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:59:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:59:46,959 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-02-21 03:59:46,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:59:46,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:59:46,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:46,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 67 transitions. [2022-02-21 03:59:46,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 03:59:46,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 31 states and 37 transitions. [2022-02-21 03:59:46,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-02-21 03:59:46,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-02-21 03:59:46,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions. [2022-02-21 03:59:46,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:59:46,975 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-02-21 03:59:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions. [2022-02-21 03:59:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-21 03:59:46,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:59:46,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 37 transitions. Second operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 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:59:46,976 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 37 transitions. Second operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 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:59:46,977 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 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:59:46,977 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:46,977 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-21 03:59:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-21 03:59:46,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:46,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:46,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 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 31 states and 37 transitions. [2022-02-21 03:59:46,978 INFO L87 Difference]: Start difference. First operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 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 31 states and 37 transitions. [2022-02-21 03:59:46,980 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:46,980 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-21 03:59:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-21 03:59:46,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:46,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:46,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:59:46,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:59:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 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:59:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-02-21 03:59:46,982 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-02-21 03:59:46,982 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-02-21 03:59:46,983 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:59:46,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2022-02-21 03:59:46,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 03:59:46,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:46,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:46,984 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:46,984 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:46,984 INFO L791 eck$LassoCheckResult]: Stem: 1836#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(9, 2);~__BLAST_NONDET~0 := 0; 1837#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 1838#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 1839#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 1843#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 1842#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 1840#L33-1 main_~i~0#1 := 0; 1841#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1853#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 1854#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1866#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1852#L35-3 [2022-02-21 03:59:46,985 INFO L793 eck$LassoCheckResult]: Loop: 1852#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 1844#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1845#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1859#L18-2 assume { :end_inline___VERIFIER_assert } true; 1855#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1856#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 1861#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1862#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 1848#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1849#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 1852#L35-3 [2022-02-21 03:59:46,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:46,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2088903217, now seen corresponding path program 3 times [2022-02-21 03:59:46,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:46,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790744780] [2022-02-21 03:59:46,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:46,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:47,010 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:47,022 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:47,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:47,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1137044896, now seen corresponding path program 1 times [2022-02-21 03:59:47,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:47,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521961088] [2022-02-21 03:59:47,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:47,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:47,076 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:59:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:47,083 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:47,094 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:47,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:47,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1923390994, now seen corresponding path program 1 times [2022-02-21 03:59:47,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:47,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488958407] [2022-02-21 03:59:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:47,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:47,131 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:47,147 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:47,278 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:47,279 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:47,279 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:47,279 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:47,279 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:59:47,279 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:47,279 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:47,279 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:47,279 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration5_Loop [2022-02-21 03:59:47,279 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:47,279 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:47,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:47,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:47,287 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:59:47,289 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:59:47,291 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:59:47,380 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:47,380 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:59:47,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:47,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:47,392 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:59:47,393 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:59:47,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:47,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:47,421 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:59:47,421 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:59:47,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:59:47,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:47,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:47,441 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:59:47,444 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:59:47,445 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:47,445 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:47,466 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:59:47,466 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:59:47,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 03:59:47,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:47,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:47,484 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:59:47,486 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:59:47,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:47,488 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:47,495 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:59:47,495 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:59:47,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 03:59:47,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:47,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:47,543 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:59:47,545 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:59:47,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:47,546 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:47,555 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:59:47,555 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:59:47,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 03:59:47,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:47,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:47,582 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:59:47,587 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:59:47,588 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:47,588 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:47,627 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:59:47,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:47,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:47,629 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:59:47,630 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:59:47,631 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:59:47,631 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:48,000 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:59:48,006 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:59:48,006 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:48,007 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:48,007 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:48,007 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:48,007 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:59:48,007 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:48,007 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:48,007 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:48,007 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration5_Loop [2022-02-21 03:59:48,007 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:48,007 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:48,008 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:59:48,013 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:59:48,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:59:48,018 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:59:48,020 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:59:48,128 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:48,128 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:59:48,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:48,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:48,130 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:59:48,131 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:59:48,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:59:48,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:48,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:48,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:48,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:48,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:48,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:48,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:48,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:59:48,170 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:59:48,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:48,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:48,172 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:59:48,172 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:59:48,174 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:59:48,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:48,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:48,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:48,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:48,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:48,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:48,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:48,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:59:48,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:48,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:48,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:48,200 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:59:48,202 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:59:48,203 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:59:48,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:48,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:48,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:48,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:48,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:48,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:48,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:48,213 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:59:48,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:59:48,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:48,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:48,231 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:48,233 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:59:48,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:59:48,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:48,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:48,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:48,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:48,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:48,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:48,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:48,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:59:48,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:59:48,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:48,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:48,259 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:48,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:59:48,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:59:48,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:48,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:48,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:48,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:48,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:48,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:48,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:48,288 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:59:48,290 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:59:48,290 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:59:48,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:48,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:48,292 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:48,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:59:48,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:59:48,295 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:59:48,295 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:59:48,295 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 3 Supporting invariants [] [2022-02-21 03:59:48,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:59:48,318 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:59:48,323 INFO L390 LassoCheck]: Loop: "assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1;" "assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "assume { :end_inline___VERIFIER_assert } true;" "main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~k~0#1 < main_~j~0#1);" "main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~j~0#1 < 3 * main_~i~0#1);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1;" [2022-02-21 03:59:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:48,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:48,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:59:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:48,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:48,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {2006#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(9, 2);~__BLAST_NONDET~0 := 0; {2006#unseeded} is VALID [2022-02-21 03:59:48,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {2006#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {2006#unseeded} is VALID [2022-02-21 03:59:48,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {2006#unseeded} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {2006#unseeded} is VALID [2022-02-21 03:59:48,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {2006#unseeded} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {2006#unseeded} is VALID [2022-02-21 03:59:48,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {2006#unseeded} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {2006#unseeded} is VALID [2022-02-21 03:59:48,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {2006#unseeded} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {2006#unseeded} is VALID [2022-02-21 03:59:48,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {2006#unseeded} main_~i~0#1 := 0; {2006#unseeded} is VALID [2022-02-21 03:59:48,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {2006#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {2006#unseeded} is VALID [2022-02-21 03:59:48,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {2006#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {2006#unseeded} is VALID [2022-02-21 03:59:48,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {2006#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2006#unseeded} is VALID [2022-02-21 03:59:48,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {2006#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {2006#unseeded} is VALID [2022-02-21 03:59:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:48,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:59:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:48,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:48,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {2009#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {2054#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:48,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {2054#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2054#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:48,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {2054#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {2054#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:48,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {2054#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} assume { :end_inline___VERIFIER_assert } true; {2054#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:48,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {2054#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2067#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3)) (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-21 03:59:48,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {2067#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3)) (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume !(main_~k~0#1 < main_~j~0#1); {2071#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3)) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-21 03:59:48,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {2071#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3)) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2075#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3)))} is VALID [2022-02-21 03:59:48,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {2075#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3)))} assume !(main_~j~0#1 < 3 * main_~i~0#1); {2079#(and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) 2) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3)))} is VALID [2022-02-21 03:59:48,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {2079#(and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) 2) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2083#(and (<= (div (+ (- 3) oldRank0) (- 2)) 1) (<= (+ (div (+ (- 3) oldRank0) (- 2)) 1) |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:48,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {2083#(and (<= (div (+ (- 3) oldRank0) (- 2)) 1) (<= (+ (div (+ (- 3) oldRank0) (- 2)) 1) |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {2019#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 3))))} is VALID [2022-02-21 03:59:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:48,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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:59:48,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:48,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 10 letters. [2022-02-21 03:59:48,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,630 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2022-02-21 03:59:48,631 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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:59:48,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:48,898 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 137 states and 166 transitions. Complement of second has 18 states. [2022-02-21 03:59:48,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2022-02-21 03:59:48,899 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:48,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. cyclomatic complexity: 8 [2022-02-21 03:59:48,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:48,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:48,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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:59:48,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-02-21 03:59:48,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:48,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:48,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 166 transitions. [2022-02-21 03:59:48,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-02-21 03:59:48,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:48,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:48,900 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 37 transitions. cyclomatic complexity: 8 [2022-02-21 03:59:48,901 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:59:48,901 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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:59:48,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-02-21 03:59:48,903 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:59:48,903 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 137 states and 166 transitions. cyclomatic complexity: 33 [2022-02-21 03:59:48,904 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 29 examples of accepted words. [2022-02-21 03:59:48,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:59:48,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 10 letters. [2022-02-21 03:59:48,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:59:48,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:59:48,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:48,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:59:48,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 14 letters. [2022-02-21 03:59:48,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 14 letters. [2022-02-21 03:59:48,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 14 letters. [2022-02-21 03:59:48,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 137 letters. Loop has 137 letters. [2022-02-21 03:59:48,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 137 letters. [2022-02-21 03:59:48,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 137 letters. Loop has 137 letters. [2022-02-21 03:59:48,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:59:48,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:59:48,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:59:48,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:59:48,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 10 letters. [2022-02-21 03:59:48,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:59:48,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:59:48,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:48,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:59:48,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:59:48,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:48,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:59:48,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:48,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:48,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:48,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:48,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:48,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:48,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:59:48,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:48,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:59:48,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:59:48,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:59:48,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:59:48,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 10 letters. [2022-02-21 03:59:48,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 10 letters. [2022-02-21 03:59:48,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 10 letters. [2022-02-21 03:59:48,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 10 letters. [2022-02-21 03:59:48,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 10 letters. [2022-02-21 03:59:48,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 20 letters. Loop has 10 letters. [2022-02-21 03:59:48,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:59:48,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 10 letters. [2022-02-21 03:59:48,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:59:48,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:59:48,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 03:59:48,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:59:48,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:59:48,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 7 letters. [2022-02-21 03:59:48,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:59:48,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 11 letters. [2022-02-21 03:59:48,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 11 letters. [2022-02-21 03:59:48,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 11 letters. [2022-02-21 03:59:48,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:59:48,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:59:48,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:59:48,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:59:48,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:59:48,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:59:48,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:59:48,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 11 letters. [2022-02-21 03:59:48,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:59:48,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:59:48,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 11 letters. [2022-02-21 03:59:48,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:59:48,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:59:48,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:59:48,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:59:48,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:48,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:48,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:48,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:59:48,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 11 letters. [2022-02-21 03:59:48,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:59:48,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:59:48,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:59:48,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:59:48,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 18 letters. [2022-02-21 03:59:48,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 18 letters. [2022-02-21 03:59:48,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 28 letters. Loop has 18 letters. [2022-02-21 03:59:48,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:59:48,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 11 letters. [2022-02-21 03:59:48,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:59:48,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 11 letters. [2022-02-21 03:59:48,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 11 letters. [2022-02-21 03:59:48,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 11 letters. [2022-02-21 03:59:48,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:59:48,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:59:48,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:59:48,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:48,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:48,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:48,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:59:48,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:59:48,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:59:48,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:59:48,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:59:48,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:59:48,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:48,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:48,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:48,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:59:48,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:59:48,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:59:48,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:48,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:48,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:48,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:59:48,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:59:48,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:59:48,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 11 letters. [2022-02-21 03:59:48,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 11 letters. [2022-02-21 03:59:48,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 11 letters. [2022-02-21 03:59:48,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:59:48,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:59:48,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:59:48,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:59:48,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:59:48,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:59:48,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:48,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:48,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:48,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:59:48,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:59:48,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:59:48,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:48,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:48,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:48,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:59:48,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:59:48,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:59:48,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 14 letters. [2022-02-21 03:59:48,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 14 letters. [2022-02-21 03:59:48,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 14 letters. [2022-02-21 03:59:48,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 37 transitions. cyclomatic complexity: 8 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:59:48,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:59:48,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 137 states and 166 transitions. cyclomatic complexity: 33 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:59:48,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,966 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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:59:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-02-21 03:59:48,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:59:48,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 21 letters. Loop has 10 letters. [2022-02-21 03:59:48,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 11 letters. Loop has 20 letters. [2022-02-21 03:59:48,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:48,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 166 transitions. cyclomatic complexity: 33 [2022-02-21 03:59:48,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-02-21 03:59:48,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 135 states and 164 transitions. [2022-02-21 03:59:48,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-02-21 03:59:48,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-02-21 03:59:48,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 164 transitions. [2022-02-21 03:59:48,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:59:48,973 INFO L681 BuchiCegarLoop]: Abstraction has 135 states and 164 transitions. [2022-02-21 03:59:48,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 164 transitions. [2022-02-21 03:59:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 81. [2022-02-21 03:59:48,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:59:48,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states and 164 transitions. Second operand has 81 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 80 states have internal predecessors, (102), 0 states have call successors, (0), 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:59:48,983 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states and 164 transitions. Second operand has 81 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 80 states have internal predecessors, (102), 0 states have call successors, (0), 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:59:48,983 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand has 81 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 80 states have internal predecessors, (102), 0 states have call successors, (0), 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:59:48,984 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:48,986 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2022-02-21 03:59:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2022-02-21 03:59:48,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:48,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:48,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 80 states have internal predecessors, (102), 0 states have call successors, (0), 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 135 states and 164 transitions. [2022-02-21 03:59:48,987 INFO L87 Difference]: Start difference. First operand has 81 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 80 states have internal predecessors, (102), 0 states have call successors, (0), 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 135 states and 164 transitions. [2022-02-21 03:59:48,987 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:48,989 INFO L93 Difference]: Finished difference Result 141 states and 174 transitions. [2022-02-21 03:59:49,003 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 174 transitions. [2022-02-21 03:59:49,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:49,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:49,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:59:49,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:59:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 80 states have internal predecessors, (102), 0 states have call successors, (0), 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:59:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2022-02-21 03:59:49,005 INFO L704 BuchiCegarLoop]: Abstraction has 81 states and 102 transitions. [2022-02-21 03:59:49,005 INFO L587 BuchiCegarLoop]: Abstraction has 81 states and 102 transitions. [2022-02-21 03:59:49,005 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:59:49,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 102 transitions. [2022-02-21 03:59:49,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2022-02-21 03:59:49,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:49,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:49,006 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:49,006 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:49,006 INFO L791 eck$LassoCheckResult]: Stem: 2255#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(9, 2);~__BLAST_NONDET~0 := 0; 2256#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 2257#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 2258#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 2262#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 2261#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 2259#L33-1 main_~i~0#1 := 0; 2260#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 2298#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 2309#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2305#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 2283#L35-3 [2022-02-21 03:59:49,007 INFO L793 eck$LassoCheckResult]: Loop: 2283#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 2263#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2264#L18 assume !(0 == __VERIFIER_assert_~cond#1); 2292#L18-2 assume { :end_inline___VERIFIER_assert } true; 2291#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2290#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 2282#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2283#L35-3 [2022-02-21 03:59:49,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:49,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2088903217, now seen corresponding path program 4 times [2022-02-21 03:59:49,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:49,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116645797] [2022-02-21 03:59:49,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:49,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:49,016 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:49,020 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:49,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:49,033 INFO L85 PathProgramCache]: Analyzing trace with hash 15031842, now seen corresponding path program 1 times [2022-02-21 03:59:49,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:49,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702906210] [2022-02-21 03:59:49,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:49,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:49,038 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:49,044 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:49,045 INFO L85 PathProgramCache]: Analyzing trace with hash 28769428, now seen corresponding path program 2 times [2022-02-21 03:59:49,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:49,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099385195] [2022-02-21 03:59:49,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:49,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:49,054 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:49,060 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:49,109 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:49,110 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:49,110 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:49,110 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:49,110 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:59:49,110 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:49,110 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:49,110 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:49,110 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration6_Loop [2022-02-21 03:59:49,111 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:49,111 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:49,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:49,113 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:59:49,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:49,126 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:59:49,128 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:59:49,195 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:49,196 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:59:49,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:49,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:49,210 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:49,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:59:49,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:49,213 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:49,231 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:59:49,231 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:59:49,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:49,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:49,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:49,250 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:49,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:59:49,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:49,254 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:49,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:49,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:49,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:49,279 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:49,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:59:49,281 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:59:49,281 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:49,668 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:59:49,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:49,672 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:49,672 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:49,673 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:49,673 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:49,673 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:59:49,673 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:49,673 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:49,673 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:49,673 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration6_Loop [2022-02-21 03:59:49,673 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:49,673 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:49,674 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:59:49,679 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:59:49,683 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:59:49,710 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:59:49,712 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:59:49,802 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:49,802 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:59:49,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:49,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:49,816 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:49,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:59:49,821 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:59:49,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:49,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:49,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:49,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:49,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:49,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:49,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:49,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:59:49,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:49,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:49,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:49,855 INFO L229 MonitoredProcess]: Starting monitored process 33 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:59:49,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:59:49,858 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:59:49,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:49,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:49,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:49,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:49,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:49,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:49,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:49,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:59:49,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:49,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:49,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:49,902 INFO L229 MonitoredProcess]: Starting monitored process 34 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:59:49,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:59:49,904 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:59:49,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:49,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:49,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:49,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:49,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:49,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:49,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:49,922 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:59:49,925 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:59:49,925 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:59:49,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:49,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:49,926 INFO L229 MonitoredProcess]: Starting monitored process 35 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:59:49,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:59:49,928 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:59:49,928 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:59:49,928 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:59:49,928 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 5*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:59:49,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:49,950 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:59:49,953 INFO L390 LassoCheck]: Loop: "assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1;" "assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "assume { :end_inline___VERIFIER_assert } true;" "main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~k~0#1 < main_~j~0#1);" "main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2022-02-21 03:59:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:49,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:49,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:59:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:49,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:50,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {2720#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(9, 2);~__BLAST_NONDET~0 := 0; {2720#unseeded} is VALID [2022-02-21 03:59:50,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {2720#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {2720#unseeded} is VALID [2022-02-21 03:59:50,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {2720#unseeded} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {2720#unseeded} is VALID [2022-02-21 03:59:50,014 INFO L290 TraceCheckUtils]: 3: Hoare triple {2720#unseeded} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {2720#unseeded} is VALID [2022-02-21 03:59:50,015 INFO L290 TraceCheckUtils]: 4: Hoare triple {2720#unseeded} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {2720#unseeded} is VALID [2022-02-21 03:59:50,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {2720#unseeded} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {2720#unseeded} is VALID [2022-02-21 03:59:50,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {2720#unseeded} main_~i~0#1 := 0; {2720#unseeded} is VALID [2022-02-21 03:59:50,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {2720#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {2720#unseeded} is VALID [2022-02-21 03:59:50,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {2720#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {2720#unseeded} is VALID [2022-02-21 03:59:50,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {2720#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2720#unseeded} is VALID [2022-02-21 03:59:50,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {2720#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {2720#unseeded} is VALID [2022-02-21 03:59:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:50,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:59:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:50,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:50,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:50,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {2723#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {2768#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:50,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {2768#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2768#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:50,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {2768#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {2768#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:50,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {2768#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} assume { :end_inline___VERIFIER_assert } true; {2768#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:50,172 INFO L290 TraceCheckUtils]: 4: Hoare triple {2768#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2781#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-21 03:59:50,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {2781#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume !(main_~k~0#1 < main_~j~0#1); {2785#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-21 03:59:50,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {2785#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2733#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|)))))} is VALID [2022-02-21 03:59:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:50,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:50,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:50,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,182 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:59:50,182 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 102 transitions. cyclomatic complexity: 25 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:50,200 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 102 transitions. cyclomatic complexity: 25. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 85 states and 106 transitions. Complement of second has 5 states. [2022-02-21 03:59:50,201 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:59:50,201 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:50,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 102 transitions. cyclomatic complexity: 25 [2022-02-21 03:59:50,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:50,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:50,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:50,202 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:59:50,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:59:50,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 106 transitions. [2022-02-21 03:59:50,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2022-02-21 03:59:50,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:50,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:50,203 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 81 states and 102 transitions. cyclomatic complexity: 25 [2022-02-21 03:59:50,204 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2022-02-21 03:59:50,204 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:50,204 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:59:50,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 9 transitions. cyclomatic complexity: 7 [2022-02-21 03:59:50,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:59:50,204 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:59:50,204 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 85 states and 106 transitions. cyclomatic complexity: 25 [2022-02-21 03:59:50,205 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2022-02-21 03:59:50,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 85 letters. Loop has 85 letters. [2022-02-21 03:59:50,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 85 letters. [2022-02-21 03:59:50,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 85 letters. Loop has 85 letters. [2022-02-21 03:59:50,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 81 letters. Loop has 81 letters. [2022-02-21 03:59:50,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 81 letters. [2022-02-21 03:59:50,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 81 letters. Loop has 81 letters. [2022-02-21 03:59:50,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:59:50,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:59:50,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:59:50,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:50,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:50,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:50,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:50,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:50,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:50,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:50,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:50,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:50,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:50,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:50,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:50,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:50,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:50,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:50,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:50,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:50,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:50,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:50,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:50,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:50,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:50,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:50,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:50,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:50,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:50,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:50,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:50,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:50,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:50,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:50,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:50,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:50,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:50,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:50,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:50,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:50,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:50,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:50,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:50,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:50,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:50,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:50,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:50,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:50,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:50,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:50,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:50,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:50,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:50,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:50,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:50,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:50,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:50,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,227 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 03:59:50,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,228 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:59:50,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:50,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:59:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:50,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:50,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {2720#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(9, 2);~__BLAST_NONDET~0 := 0; {2720#unseeded} is VALID [2022-02-21 03:59:50,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {2720#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {2720#unseeded} is VALID [2022-02-21 03:59:50,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {2720#unseeded} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {2720#unseeded} is VALID [2022-02-21 03:59:50,273 INFO L290 TraceCheckUtils]: 3: Hoare triple {2720#unseeded} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {2720#unseeded} is VALID [2022-02-21 03:59:50,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {2720#unseeded} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {2720#unseeded} is VALID [2022-02-21 03:59:50,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {2720#unseeded} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {2720#unseeded} is VALID [2022-02-21 03:59:50,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {2720#unseeded} main_~i~0#1 := 0; {2720#unseeded} is VALID [2022-02-21 03:59:50,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {2720#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {2720#unseeded} is VALID [2022-02-21 03:59:50,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {2720#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {2720#unseeded} is VALID [2022-02-21 03:59:50,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {2720#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2720#unseeded} is VALID [2022-02-21 03:59:50,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {2720#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {2720#unseeded} is VALID [2022-02-21 03:59:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:50,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:59:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:50,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:50,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {2723#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {2915#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:50,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {2915#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2915#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:50,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {2915#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {2915#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:50,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {2915#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} assume { :end_inline___VERIFIER_assert } true; {2915#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:50,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {2915#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2928#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-21 03:59:50,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {2928#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume !(main_~k~0#1 < main_~j~0#1); {2932#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-21 03:59:50,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {2932#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2733#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|)))))} is VALID [2022-02-21 03:59:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:50,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:50,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:50,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,414 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:59:50,414 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 102 transitions. cyclomatic complexity: 25 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:50,427 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 102 transitions. cyclomatic complexity: 25. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 85 states and 106 transitions. Complement of second has 5 states. [2022-02-21 03:59:50,427 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:59:50,428 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:50,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 102 transitions. cyclomatic complexity: 25 [2022-02-21 03:59:50,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:50,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:50,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:50,428 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:59:50,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:59:50,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 106 transitions. [2022-02-21 03:59:50,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2022-02-21 03:59:50,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:50,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:50,429 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 81 states and 102 transitions. cyclomatic complexity: 25 [2022-02-21 03:59:50,429 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2022-02-21 03:59:50,429 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:50,430 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:59:50,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 9 transitions. cyclomatic complexity: 7 [2022-02-21 03:59:50,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:59:50,430 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:59:50,430 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 85 states and 106 transitions. cyclomatic complexity: 25 [2022-02-21 03:59:50,431 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2022-02-21 03:59:50,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 85 letters. Loop has 85 letters. [2022-02-21 03:59:50,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 85 letters. [2022-02-21 03:59:50,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 85 letters. Loop has 85 letters. [2022-02-21 03:59:50,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 81 letters. Loop has 81 letters. [2022-02-21 03:59:50,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 81 letters. [2022-02-21 03:59:50,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 81 letters. Loop has 81 letters. [2022-02-21 03:59:50,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:59:50,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:59:50,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:59:50,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:50,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:50,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:50,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:50,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:50,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:50,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:50,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:50,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:50,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:50,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:50,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:50,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:50,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:50,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:50,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:50,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:50,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:50,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:50,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:50,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:50,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:50,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:50,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:50,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:50,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:50,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:50,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:50,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:50,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:50,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:50,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:50,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:50,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:50,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:50,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:50,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:50,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:50,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:50,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:50,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:50,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:50,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:50,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:50,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:50,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:50,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:50,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:50,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:50,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:50,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:50,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:50,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:50,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:50,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 106 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,454 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 03:59:50,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,455 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:59:50,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:50,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:59:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:50,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:50,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {2720#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(9, 2);~__BLAST_NONDET~0 := 0; {2720#unseeded} is VALID [2022-02-21 03:59:50,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {2720#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {2720#unseeded} is VALID [2022-02-21 03:59:50,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {2720#unseeded} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {2720#unseeded} is VALID [2022-02-21 03:59:50,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {2720#unseeded} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {2720#unseeded} is VALID [2022-02-21 03:59:50,490 INFO L290 TraceCheckUtils]: 4: Hoare triple {2720#unseeded} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {2720#unseeded} is VALID [2022-02-21 03:59:50,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {2720#unseeded} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {2720#unseeded} is VALID [2022-02-21 03:59:50,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {2720#unseeded} main_~i~0#1 := 0; {2720#unseeded} is VALID [2022-02-21 03:59:50,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {2720#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {2720#unseeded} is VALID [2022-02-21 03:59:50,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {2720#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {2720#unseeded} is VALID [2022-02-21 03:59:50,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {2720#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2720#unseeded} is VALID [2022-02-21 03:59:50,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {2720#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {2720#unseeded} is VALID [2022-02-21 03:59:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:50,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:59:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:50,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:50,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {2723#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {3062#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:50,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {3062#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3062#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:50,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {3062#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {3062#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:50,619 INFO L290 TraceCheckUtils]: 3: Hoare triple {3062#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} assume { :end_inline___VERIFIER_assert } true; {3062#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:50,619 INFO L290 TraceCheckUtils]: 4: Hoare triple {3062#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-21 03:59:50,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {3075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume !(main_~k~0#1 < main_~j~0#1); {3079#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-21 03:59:50,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {3079#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|))) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2733#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 5 |ULTIMATE.start_main_~i~0#1|)))))} is VALID [2022-02-21 03:59:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:50,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:50,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:50,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,629 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:59:50,629 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 102 transitions. cyclomatic complexity: 25 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:50,789 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 102 transitions. cyclomatic complexity: 25. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 183 states and 223 transitions. Complement of second has 10 states. [2022-02-21 03:59:50,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-02-21 03:59:50,789 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:50,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 102 transitions. cyclomatic complexity: 25 [2022-02-21 03:59:50,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:50,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:50,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:50,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:59:50,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:50,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:50,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 223 transitions. [2022-02-21 03:59:50,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-02-21 03:59:50,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:50,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:50,791 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 81 states and 102 transitions. cyclomatic complexity: 25 [2022-02-21 03:59:50,791 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2022-02-21 03:59:50,792 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:50,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:59:50,792 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:59:50,792 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 183 states and 223 transitions. cyclomatic complexity: 45 [2022-02-21 03:59:50,793 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 17 examples of accepted words. [2022-02-21 03:59:50,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:59:50,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:59:50,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:59:50,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 14 letters. [2022-02-21 03:59:50,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 14 letters. [2022-02-21 03:59:50,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 11 letters. Loop has 14 letters. [2022-02-21 03:59:50,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 183 letters. Loop has 183 letters. [2022-02-21 03:59:50,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 183 letters. Loop has 183 letters. [2022-02-21 03:59:50,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 183 letters. Loop has 183 letters. [2022-02-21 03:59:50,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 81 letters. Loop has 81 letters. [2022-02-21 03:59:50,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 81 letters. [2022-02-21 03:59:50,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 81 letters. Loop has 81 letters. [2022-02-21 03:59:50,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:59:50,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:59:50,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:59:50,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:50,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:50,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:59:50,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:50,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:50,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:59:50,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:50,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:50,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:59:50,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:50,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:50,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:59:50,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:50,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:50,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:59:50,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:50,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:50,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:59:50,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:50,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:50,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:59:50,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:50,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:50,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:59:50,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:50,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:50,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:59:50,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:59:50,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:59:50,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:59:50,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:59:50,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:59:50,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:59:50,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 14 letters. [2022-02-21 03:59:50,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 14 letters. [2022-02-21 03:59:50,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 11 letters. Loop has 14 letters. [2022-02-21 03:59:50,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 11 letters. [2022-02-21 03:59:50,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 11 letters. [2022-02-21 03:59:50,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 18 letters. Loop has 11 letters. [2022-02-21 03:59:50,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:59:50,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:59:50,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:59:50,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:50,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 11 letters. [2022-02-21 03:59:50,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 11 letters. [2022-02-21 03:59:50,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 11 letters. [2022-02-21 03:59:50,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:59:50,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:59:50,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:59:50,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:59:50,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 11 letters. [2022-02-21 03:59:50,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 11 letters. [2022-02-21 03:59:50,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 23 letters. Loop has 11 letters. [2022-02-21 03:59:50,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:59:50,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:59:50,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:59:50,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 11 letters. [2022-02-21 03:59:50,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 11 letters. [2022-02-21 03:59:50,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 19 letters. Loop has 11 letters. [2022-02-21 03:59:50,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:59:50,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:59:50,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:59:50,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:59:50,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:59:50,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:59:50,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:59:50,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:59:50,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:59:50,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:50,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 24 letters. Loop has 14 letters. [2022-02-21 03:59:50,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 102 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 223 transitions. cyclomatic complexity: 45 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:59:50,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,832 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-21 03:59:50,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:59:50,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:59:50,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 11 letters. Loop has 14 letters. [2022-02-21 03:59:50,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:50,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 223 transitions. cyclomatic complexity: 45 [2022-02-21 03:59:50,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-02-21 03:59:50,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 169 states and 207 transitions. [2022-02-21 03:59:50,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2022-02-21 03:59:50,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-02-21 03:59:50,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 207 transitions. [2022-02-21 03:59:50,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:59:50,839 INFO L681 BuchiCegarLoop]: Abstraction has 169 states and 207 transitions. [2022-02-21 03:59:50,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 207 transitions. [2022-02-21 03:59:50,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 126. [2022-02-21 03:59:50,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:59:50,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states and 207 transitions. Second operand has 126 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 125 states have internal predecessors, (160), 0 states have call successors, (0), 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:59:50,842 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states and 207 transitions. Second operand has 126 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 125 states have internal predecessors, (160), 0 states have call successors, (0), 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:59:50,843 INFO L87 Difference]: Start difference. First operand 169 states and 207 transitions. Second operand has 126 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 125 states have internal predecessors, (160), 0 states have call successors, (0), 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:59:50,843 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:50,845 INFO L93 Difference]: Finished difference Result 172 states and 215 transitions. [2022-02-21 03:59:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 215 transitions. [2022-02-21 03:59:50,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:50,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:50,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 125 states have internal predecessors, (160), 0 states have call successors, (0), 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 169 states and 207 transitions. [2022-02-21 03:59:50,846 INFO L87 Difference]: Start difference. First operand has 126 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 125 states have internal predecessors, (160), 0 states have call successors, (0), 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 169 states and 207 transitions. [2022-02-21 03:59:50,846 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:50,850 INFO L93 Difference]: Finished difference Result 291 states and 352 transitions. [2022-02-21 03:59:50,850 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 352 transitions. [2022-02-21 03:59:50,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:50,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:50,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:59:50,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:59:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 125 states have internal predecessors, (160), 0 states have call successors, (0), 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:59:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 160 transitions. [2022-02-21 03:59:50,853 INFO L704 BuchiCegarLoop]: Abstraction has 126 states and 160 transitions. [2022-02-21 03:59:50,853 INFO L587 BuchiCegarLoop]: Abstraction has 126 states and 160 transitions. [2022-02-21 03:59:50,853 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:59:50,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 160 transitions. [2022-02-21 03:59:50,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2022-02-21 03:59:50,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:50,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:50,854 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:50,854 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:50,854 INFO L791 eck$LassoCheckResult]: Stem: 3282#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(9, 2);~__BLAST_NONDET~0 := 0; 3283#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 3284#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 3285#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 3289#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 3288#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 3286#L33-1 main_~i~0#1 := 0; 3287#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 3312#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 3296#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3297#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 3320#L35-3 [2022-02-21 03:59:50,854 INFO L793 eck$LassoCheckResult]: Loop: 3320#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 3315#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3318#L18 assume !(0 == __VERIFIER_assert_~cond#1); 3317#L18-2 assume { :end_inline___VERIFIER_assert } true; 3302#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 3290#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3291#L18 assume !(0 == __VERIFIER_assert_~cond#1); 3304#L18-2 assume { :end_inline___VERIFIER_assert } true; 3307#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 3316#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 3309#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3310#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 3294#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3295#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 3320#L35-3 [2022-02-21 03:59:50,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:50,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2088903217, now seen corresponding path program 5 times [2022-02-21 03:59:50,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:50,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112126168] [2022-02-21 03:59:50,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:50,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:50,863 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:50,867 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:50,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:50,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2069021769, now seen corresponding path program 2 times [2022-02-21 03:59:50,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:50,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783291627] [2022-02-21 03:59:50,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:50,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:50,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {3980#true} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {3982#(and (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| 1) (* |ULTIMATE.start_main_~i~0#1| 4)))} is VALID [2022-02-21 03:59:50,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {3982#(and (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| 1) (* |ULTIMATE.start_main_~i~0#1| 4)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3982#(and (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| 1) (* |ULTIMATE.start_main_~i~0#1| 4)))} is VALID [2022-02-21 03:59:50,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {3982#(and (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| 1) (* |ULTIMATE.start_main_~i~0#1| 4)))} assume !(0 == __VERIFIER_assert_~cond#1); {3982#(and (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| 1) (* |ULTIMATE.start_main_~i~0#1| 4)))} is VALID [2022-02-21 03:59:50,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {3982#(and (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| 1) (* |ULTIMATE.start_main_~i~0#1| 4)))} assume { :end_inline___VERIFIER_assert } true; {3982#(and (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| 1) (* |ULTIMATE.start_main_~i~0#1| 4)))} is VALID [2022-02-21 03:59:50,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {3982#(and (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| 1) (* |ULTIMATE.start_main_~i~0#1| 4)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3983#(and (or (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~k~0#1|)) (or (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|) (* |ULTIMATE.start_main_~i~0#1| 4)) (not (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~k~0#1|))))} is VALID [2022-02-21 03:59:50,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {3983#(and (or (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~k~0#1|)) (or (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|) (* |ULTIMATE.start_main_~i~0#1| 4)) (not (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~k~0#1|))))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3984#(and (< |ULTIMATE.start_main_~k~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:50,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {3984#(and (< |ULTIMATE.start_main_~k~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~k~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {3984#(and (< |ULTIMATE.start_main_~k~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:50,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {3984#(and (< |ULTIMATE.start_main_~k~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~k~0#1|))} assume { :end_inline___VERIFIER_assert } true; {3984#(and (< |ULTIMATE.start_main_~k~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:50,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {3984#(and (< |ULTIMATE.start_main_~k~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~k~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3985#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:50,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {3985#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|))} assume !(main_~k~0#1 < main_~j~0#1); {3986#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:50,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {3986#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3987#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) (* 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:50,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {3987#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) (* 3 |ULTIMATE.start_main_~i~0#1|))} assume !(main_~j~0#1 < 3 * main_~i~0#1); {3981#false} is VALID [2022-02-21 03:59:50,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {3981#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3981#false} is VALID [2022-02-21 03:59:50,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {3981#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {3981#false} is VALID [2022-02-21 03:59:50,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:50,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:59:50,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783291627] [2022-02-21 03:59:50,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783291627] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:59:50,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499978798] [2022-02-21 03:59:50,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:59:50,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:59:50,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:50,949 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:59:50,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-02-21 03:59:50,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:59:50,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:59:50,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:59:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:50,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:51,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {3980#true} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {3991#(and (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:51,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {3991#(and (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3991#(and (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:51,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {3991#(and (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {3991#(and (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:51,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {3991#(and (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {3991#(and (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:51,201 INFO L290 TraceCheckUtils]: 4: Hoare triple {3991#(and (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4004#(and (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~i~0#1| (+ (- 1) |ULTIMATE.start_main_~k~0#1|)))} is VALID [2022-02-21 03:59:51,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {4004#(and (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~i~0#1| (+ (- 1) |ULTIMATE.start_main_~k~0#1|)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4008#(and (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~i~0#1| (+ (- 1) |ULTIMATE.start_main_~k~0#1|)) (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:59:51,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {4008#(and (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~i~0#1| (+ (- 1) |ULTIMATE.start_main_~k~0#1|)) (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {4008#(and (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~i~0#1| (+ (- 1) |ULTIMATE.start_main_~k~0#1|)) (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:59:51,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {4008#(and (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~i~0#1| (+ (- 1) |ULTIMATE.start_main_~k~0#1|)) (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~j~0#1|))} assume { :end_inline___VERIFIER_assert } true; {4008#(and (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~i~0#1| (+ (- 1) |ULTIMATE.start_main_~k~0#1|)) (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:59:51,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {4008#(and (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~i~0#1| (+ (- 1) |ULTIMATE.start_main_~k~0#1|)) (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~j~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4018#(and (<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:59:51,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {4018#(and (<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|))} assume !(main_~k~0#1 < main_~j~0#1); {4022#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:59:51,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {4022#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_~j~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4026#(and (< 2 (* 2 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:51,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {4026#(and (< 2 (* 2 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)))} assume !(main_~j~0#1 < 3 * main_~i~0#1); {3981#false} is VALID [2022-02-21 03:59:51,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {3981#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3981#false} is VALID [2022-02-21 03:59:51,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {3981#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {3981#false} is VALID [2022-02-21 03:59:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:51,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:59:51,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {3981#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {3981#false} is VALID [2022-02-21 03:59:51,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {3981#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3981#false} is VALID [2022-02-21 03:59:51,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {3987#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) (* 3 |ULTIMATE.start_main_~i~0#1|))} assume !(main_~j~0#1 < 3 * main_~i~0#1); {3981#false} is VALID [2022-02-21 03:59:51,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {3986#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3987#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) (* 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:51,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {4048#(or (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~j~0#1|))} assume !(main_~k~0#1 < main_~j~0#1); {3986#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:51,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {4052#(or (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4048#(or (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-21 03:59:51,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {4052#(or (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {4052#(or (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:51,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {4052#(or (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {4052#(or (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:51,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {4062#(or (not (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~j~0#1|)) (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4052#(or (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:51,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {4066#(or (< (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|) (not (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|)) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4062#(or (not (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~j~0#1|)) (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:51,387 INFO L290 TraceCheckUtils]: 3: Hoare triple {4066#(or (< (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|) (not (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|)) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {4066#(or (< (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|) (not (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|)) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:51,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {4066#(or (< (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|) (not (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|)) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {4066#(or (< (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|) (not (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|)) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:51,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {4066#(or (< (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|) (not (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|)) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4066#(or (< (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|) (not (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|)) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:51,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {3980#true} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {4066#(or (< (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|) (not (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|)) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:51,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499978798] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:59:51,389 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:59:51,389 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-02-21 03:59:51,389 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482587296] [2022-02-21 03:59:51,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:59:51,390 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:59:51,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:59:51,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-21 03:59:51,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-02-21 03:59:51,391 INFO L87 Difference]: Start difference. First operand 126 states and 160 transitions. cyclomatic complexity: 38 Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 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:59:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:59:52,103 INFO L93 Difference]: Finished difference Result 438 states and 528 transitions. [2022-02-21 03:59:52,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-21 03:59:52,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 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:59:52,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:52,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 438 states and 528 transitions. [2022-02-21 03:59:52,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 105 [2022-02-21 03:59:52,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 438 states to 438 states and 528 transitions. [2022-02-21 03:59:52,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2022-02-21 03:59:52,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2022-02-21 03:59:52,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 438 states and 528 transitions. [2022-02-21 03:59:52,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:59:52,145 INFO L681 BuchiCegarLoop]: Abstraction has 438 states and 528 transitions. [2022-02-21 03:59:52,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states and 528 transitions. [2022-02-21 03:59:52,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 226. [2022-02-21 03:59:52,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:59:52,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 438 states and 528 transitions. Second operand has 226 states, 226 states have (on average 1.2212389380530972) internal successors, (276), 225 states have internal predecessors, (276), 0 states have call successors, (0), 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:59:52,150 INFO L74 IsIncluded]: Start isIncluded. First operand 438 states and 528 transitions. Second operand has 226 states, 226 states have (on average 1.2212389380530972) internal successors, (276), 225 states have internal predecessors, (276), 0 states have call successors, (0), 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:59:52,150 INFO L87 Difference]: Start difference. First operand 438 states and 528 transitions. Second operand has 226 states, 226 states have (on average 1.2212389380530972) internal successors, (276), 225 states have internal predecessors, (276), 0 states have call successors, (0), 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:59:52,151 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:52,157 INFO L93 Difference]: Finished difference Result 441 states and 536 transitions. [2022-02-21 03:59:52,158 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 536 transitions. [2022-02-21 03:59:52,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:52,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:52,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 226 states have (on average 1.2212389380530972) internal successors, (276), 225 states have internal predecessors, (276), 0 states have call successors, (0), 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 438 states and 528 transitions. [2022-02-21 03:59:52,159 INFO L87 Difference]: Start difference. First operand has 226 states, 226 states have (on average 1.2212389380530972) internal successors, (276), 225 states have internal predecessors, (276), 0 states have call successors, (0), 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 438 states and 528 transitions. [2022-02-21 03:59:52,159 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:52,167 INFO L93 Difference]: Finished difference Result 441 states and 536 transitions. [2022-02-21 03:59:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 536 transitions. [2022-02-21 03:59:52,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:52,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:52,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:59:52,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:59:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 226 states have (on average 1.2212389380530972) internal successors, (276), 225 states have internal predecessors, (276), 0 states have call successors, (0), 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:59:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 276 transitions. [2022-02-21 03:59:52,172 INFO L704 BuchiCegarLoop]: Abstraction has 226 states and 276 transitions. [2022-02-21 03:59:52,172 INFO L587 BuchiCegarLoop]: Abstraction has 226 states and 276 transitions. [2022-02-21 03:59:52,172 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:59:52,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 276 transitions. [2022-02-21 03:59:52,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2022-02-21 03:59:52,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:52,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:52,174 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:52,174 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:52,174 INFO L791 eck$LassoCheckResult]: Stem: 4552#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(9, 2);~__BLAST_NONDET~0 := 0; 4553#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 4554#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 4555#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 4559#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 4558#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 4556#L33-1 main_~i~0#1 := 0; 4557#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 4585#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 4595#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4596#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 4594#L35-3 [2022-02-21 03:59:52,174 INFO L793 eck$LassoCheckResult]: Loop: 4594#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 4589#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4617#L18 assume !(0 == __VERIFIER_assert_~cond#1); 4615#L18-2 assume { :end_inline___VERIFIER_assert } true; 4602#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4560#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4561#L18 assume !(0 == __VERIFIER_assert_~cond#1); 4733#L18-2 assume { :end_inline___VERIFIER_assert } true; 4728#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4729#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4737#L18 assume !(0 == __VERIFIER_assert_~cond#1); 4581#L18-2 assume { :end_inline___VERIFIER_assert } true; 4573#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4574#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 4590#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4588#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 4564#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4565#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 4594#L35-3 [2022-02-21 03:59:52,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:52,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2088903217, now seen corresponding path program 6 times [2022-02-21 03:59:52,175 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:52,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316769910] [2022-02-21 03:59:52,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:52,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:52,183 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:52,188 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:52,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:52,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1182901838, now seen corresponding path program 3 times [2022-02-21 03:59:52,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:52,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276610454] [2022-02-21 03:59:52,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:52,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:52,197 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:52,202 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:52,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:52,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1513942172, now seen corresponding path program 3 times [2022-02-21 03:59:52,203 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:52,203 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690537523] [2022-02-21 03:59:52,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:52,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:52,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {5809#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(9, 2);~__BLAST_NONDET~0 := 0; {5809#true} is VALID [2022-02-21 03:59:52,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {5809#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {5809#true} is VALID [2022-02-21 03:59:52,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {5809#true} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {5809#true} is VALID [2022-02-21 03:59:52,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {5809#true} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {5809#true} is VALID [2022-02-21 03:59:52,262 INFO L290 TraceCheckUtils]: 4: Hoare triple {5809#true} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {5809#true} is VALID [2022-02-21 03:59:52,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {5809#true} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {5809#true} is VALID [2022-02-21 03:59:52,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {5809#true} main_~i~0#1 := 0; {5811#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:52,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {5811#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {5811#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:52,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {5811#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < 3 * main_~i~0#1); {5811#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:52,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {5811#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5812#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:52,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {5812#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {5813#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:59:52,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {5813#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {5814#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 03:59:52,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {5814#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5814#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 03:59:52,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {5814#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} assume !(0 == __VERIFIER_assert_~cond#1); {5814#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 03:59:52,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {5814#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} assume { :end_inline___VERIFIER_assert } true; {5814#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 03:59:52,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {5814#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5815#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-21 03:59:52,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {5815#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5810#false} is VALID [2022-02-21 03:59:52,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {5810#false} assume !(0 == __VERIFIER_assert_~cond#1); {5810#false} is VALID [2022-02-21 03:59:52,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {5810#false} assume { :end_inline___VERIFIER_assert } true; {5810#false} is VALID [2022-02-21 03:59:52,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {5810#false} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5810#false} is VALID [2022-02-21 03:59:52,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {5810#false} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5810#false} is VALID [2022-02-21 03:59:52,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {5810#false} assume !(0 == __VERIFIER_assert_~cond#1); {5810#false} is VALID [2022-02-21 03:59:52,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {5810#false} assume { :end_inline___VERIFIER_assert } true; {5810#false} is VALID [2022-02-21 03:59:52,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {5810#false} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5810#false} is VALID [2022-02-21 03:59:52,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {5810#false} assume !(main_~k~0#1 < main_~j~0#1); {5810#false} is VALID [2022-02-21 03:59:52,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {5810#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5810#false} is VALID [2022-02-21 03:59:52,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {5810#false} assume !(main_~j~0#1 < 3 * main_~i~0#1); {5810#false} is VALID [2022-02-21 03:59:52,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {5810#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5810#false} is VALID [2022-02-21 03:59:52,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {5810#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {5810#false} is VALID [2022-02-21 03:59:52,273 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:59:52,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:59:52,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690537523] [2022-02-21 03:59:52,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690537523] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:59:52,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254702870] [2022-02-21 03:59:52,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:59:52,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:59:52,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:52,288 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:59:52,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-02-21 03:59:52,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-21 03:59:52,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:59:52,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:59:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:52,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:52,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {5809#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(9, 2);~__BLAST_NONDET~0 := 0; {5809#true} is VALID [2022-02-21 03:59:52,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {5809#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {5809#true} is VALID [2022-02-21 03:59:52,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {5809#true} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {5809#true} is VALID [2022-02-21 03:59:52,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {5809#true} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {5809#true} is VALID [2022-02-21 03:59:52,817 INFO L290 TraceCheckUtils]: 4: Hoare triple {5809#true} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {5809#true} is VALID [2022-02-21 03:59:52,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {5809#true} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {5809#true} is VALID [2022-02-21 03:59:52,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {5809#true} main_~i~0#1 := 0; {5837#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:52,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {5837#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {5837#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:52,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {5837#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < 3 * main_~i~0#1); {5837#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:52,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {5837#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5812#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:52,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {5812#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {5850#(and (<= |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:59:52,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {5850#(and (<= |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {5854#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:52,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {5854#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5854#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:52,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {5854#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) |ULTIMATE.start_main_~k~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {5854#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:52,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {5854#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) |ULTIMATE.start_main_~k~0#1|))} assume { :end_inline___VERIFIER_assert } true; {5854#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:52,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {5854#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) |ULTIMATE.start_main_~k~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5867#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:52,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {5867#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5867#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:52,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {5867#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) |ULTIMATE.start_main_~k~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {5867#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:52,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {5867#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) |ULTIMATE.start_main_~k~0#1|))} assume { :end_inline___VERIFIER_assert } true; {5867#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:52,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {5867#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) |ULTIMATE.start_main_~k~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5880#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (+ 2 (div (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 2))) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:52,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {5880#(and (<= (div (- |ULTIMATE.start_main_~j~0#1|) (- 2)) 1) (<= (+ 2 (div (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 2))) |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5810#false} is VALID [2022-02-21 03:59:52,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {5810#false} assume !(0 == __VERIFIER_assert_~cond#1); {5810#false} is VALID [2022-02-21 03:59:52,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {5810#false} assume { :end_inline___VERIFIER_assert } true; {5810#false} is VALID [2022-02-21 03:59:52,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {5810#false} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5810#false} is VALID [2022-02-21 03:59:52,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {5810#false} assume !(main_~k~0#1 < main_~j~0#1); {5810#false} is VALID [2022-02-21 03:59:52,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {5810#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5810#false} is VALID [2022-02-21 03:59:52,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {5810#false} assume !(main_~j~0#1 < 3 * main_~i~0#1); {5810#false} is VALID [2022-02-21 03:59:52,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {5810#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5810#false} is VALID [2022-02-21 03:59:52,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {5810#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {5810#false} is VALID [2022-02-21 03:59:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:52,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:59:52,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {5810#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {5810#false} is VALID [2022-02-21 03:59:52,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {5810#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5810#false} is VALID [2022-02-21 03:59:52,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {5810#false} assume !(main_~j~0#1 < 3 * main_~i~0#1); {5810#false} is VALID [2022-02-21 03:59:52,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {5810#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5810#false} is VALID [2022-02-21 03:59:52,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {5810#false} assume !(main_~k~0#1 < main_~j~0#1); {5810#false} is VALID [2022-02-21 03:59:52,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {5810#false} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5810#false} is VALID [2022-02-21 03:59:52,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {5810#false} assume { :end_inline___VERIFIER_assert } true; {5810#false} is VALID [2022-02-21 03:59:52,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {5810#false} assume !(0 == __VERIFIER_assert_~cond#1); {5810#false} is VALID [2022-02-21 03:59:52,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {5815#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5810#false} is VALID [2022-02-21 03:59:52,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {5814#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5815#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-21 03:59:52,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {5814#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} assume { :end_inline___VERIFIER_assert } true; {5814#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 03:59:52,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {5814#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} assume !(0 == __VERIFIER_assert_~cond#1); {5814#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 03:59:52,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {5814#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5814#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 03:59:52,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {5947#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5814#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 03:59:52,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {5947#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} assume { :end_inline___VERIFIER_assert } true; {5947#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:52,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {5947#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {5947#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:52,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {5947#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5947#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:52,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {5960#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {5947#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:52,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {5964#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {5960#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:52,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {5812#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5964#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:59:52,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {5812#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~j~0#1 < 3 * main_~i~0#1); {5812#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:52,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {5812#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {5812#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:52,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {5809#true} main_~i~0#1 := 0; {5812#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:52,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {5809#true} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {5809#true} is VALID [2022-02-21 03:59:52,981 INFO L290 TraceCheckUtils]: 4: Hoare triple {5809#true} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {5809#true} is VALID [2022-02-21 03:59:52,981 INFO L290 TraceCheckUtils]: 3: Hoare triple {5809#true} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {5809#true} is VALID [2022-02-21 03:59:52,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {5809#true} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {5809#true} is VALID [2022-02-21 03:59:52,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {5809#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {5809#true} is VALID [2022-02-21 03:59:52,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {5809#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(9, 2);~__BLAST_NONDET~0 := 0; {5809#true} is VALID [2022-02-21 03:59:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:52,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254702870] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:59:52,981 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:59:52,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2022-02-21 03:59:52,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144455184] [2022-02-21 03:59:52,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:59:53,123 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:53,124 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:53,124 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:53,124 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:53,124 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:59:53,124 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:53,124 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:53,124 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:53,124 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration8_Loop [2022-02-21 03:59:53,124 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:53,124 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:53,125 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:59:53,127 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:59:53,129 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:59:53,131 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:59:53,142 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:59:53,210 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:53,210 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:59:53,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:53,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:53,244 INFO L229 MonitoredProcess]: Starting monitored process 38 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:59:53,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:59:53,247 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:53,247 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:53,254 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:59:53,254 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:59:53,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:53,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:53,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:53,271 INFO L229 MonitoredProcess]: Starting monitored process 39 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:59:53,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:59:53,274 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:53,274 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:53,292 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:59:53,292 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:59:53,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:53,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:53,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:53,309 INFO L229 MonitoredProcess]: Starting monitored process 40 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:59:53,313 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:53,313 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:53,319 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:59:53,319 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:59:53,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:59:53,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:53,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:53,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:53,339 INFO L229 MonitoredProcess]: Starting monitored process 41 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:59:53,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:59:53,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:53,341 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:53,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:53,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:53,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:53,367 INFO L229 MonitoredProcess]: Starting monitored process 42 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:59:53,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:59:53,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:59:53,370 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:53,677 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:59:53,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:53,685 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:53,685 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:53,685 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:53,685 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:53,685 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:59:53,685 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:53,685 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:53,685 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:53,685 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration8_Loop [2022-02-21 03:59:53,685 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:53,685 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:53,686 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:59:53,688 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:59:53,690 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:59:53,694 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:59:53,705 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:59:53,795 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:53,795 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:59:53,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:53,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:53,796 INFO L229 MonitoredProcess]: Starting monitored process 43 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:59:53,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:59:53,799 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:59:53,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:53,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:53,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:53,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:53,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:53,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:53,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:53,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:59:53,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 03:59:53,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:53,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:53,838 INFO L229 MonitoredProcess]: Starting monitored process 44 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:59:53,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:59:53,841 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:59:53,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:53,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:53,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:53,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:53,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:53,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:53,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:53,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:59:53,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 03:59:53,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:53,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:53,881 INFO L229 MonitoredProcess]: Starting monitored process 45 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:59:53,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:59:53,883 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:59:53,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:53,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:53,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:53,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:53,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:53,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:53,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:53,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:59:53,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-02-21 03:59:53,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:53,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:53,922 INFO L229 MonitoredProcess]: Starting monitored process 46 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:59:53,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:59:53,924 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:59:53,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:53,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:53,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:53,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:53,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:53,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:53,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:53,947 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:59:53,949 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:59:53,949 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:59:53,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:53,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:53,951 INFO L229 MonitoredProcess]: Starting monitored process 47 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:59:53,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:59:53,953 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:59:53,953 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:59:53,953 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:59:53,953 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [] [2022-02-21 03:59:53,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 03:59:53,974 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:59:53,977 INFO L390 LassoCheck]: Loop: "assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1;" "assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "assume { :end_inline___VERIFIER_assert } true;" "main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "assume { :end_inline___VERIFIER_assert } true;" "main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "assume { :end_inline___VERIFIER_assert } true;" "main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~k~0#1 < main_~j~0#1);" "main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~j~0#1 < 3 * main_~i~0#1);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1;" [2022-02-21 03:59:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:54,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:59:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:54,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:54,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {5992#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(9, 2);~__BLAST_NONDET~0 := 0; {5992#unseeded} is VALID [2022-02-21 03:59:54,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {5992#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {5992#unseeded} is VALID [2022-02-21 03:59:54,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {5992#unseeded} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {5992#unseeded} is VALID [2022-02-21 03:59:54,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {5992#unseeded} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {5992#unseeded} is VALID [2022-02-21 03:59:54,025 INFO L290 TraceCheckUtils]: 4: Hoare triple {5992#unseeded} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {5992#unseeded} is VALID [2022-02-21 03:59:54,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {5992#unseeded} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {5992#unseeded} is VALID [2022-02-21 03:59:54,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {5992#unseeded} main_~i~0#1 := 0; {5992#unseeded} is VALID [2022-02-21 03:59:54,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {5992#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {5992#unseeded} is VALID [2022-02-21 03:59:54,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {5992#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {5992#unseeded} is VALID [2022-02-21 03:59:54,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {5992#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5992#unseeded} is VALID [2022-02-21 03:59:54,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {5992#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {5992#unseeded} is VALID [2022-02-21 03:59:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:54,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:59:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:54,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:54,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {5995#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {6040#(and (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} is VALID [2022-02-21 03:59:54,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {6040#(and (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {6040#(and (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} is VALID [2022-02-21 03:59:54,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {6040#(and (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} assume !(0 == __VERIFIER_assert_~cond#1); {6040#(and (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} is VALID [2022-02-21 03:59:54,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {6040#(and (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} assume { :end_inline___VERIFIER_assert } true; {6040#(and (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} is VALID [2022-02-21 03:59:54,327 INFO L290 TraceCheckUtils]: 4: Hoare triple {6040#(and (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6053#(and (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} is VALID [2022-02-21 03:59:54,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {6053#(and (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {6053#(and (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} is VALID [2022-02-21 03:59:54,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {6053#(and (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} assume !(0 == __VERIFIER_assert_~cond#1); {6053#(and (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} is VALID [2022-02-21 03:59:54,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {6053#(and (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} assume { :end_inline___VERIFIER_assert } true; {6053#(and (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} is VALID [2022-02-21 03:59:54,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {6053#(and (<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6066#(and (<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} is VALID [2022-02-21 03:59:54,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {6066#(and (<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {6066#(and (<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} is VALID [2022-02-21 03:59:54,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {6066#(and (<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} assume !(0 == __VERIFIER_assert_~cond#1); {6066#(and (<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} is VALID [2022-02-21 03:59:54,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {6066#(and (<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} assume { :end_inline___VERIFIER_assert } true; {6066#(and (<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} is VALID [2022-02-21 03:59:54,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {6066#(and (<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {6079#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)) (<= |ULTIMATE.start_main_~k~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:54,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {6079#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)) (<= |ULTIMATE.start_main_~k~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)))} assume !(main_~k~0#1 < main_~j~0#1); {6083#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} is VALID [2022-02-21 03:59:54,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {6083#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6087#(and (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} is VALID [2022-02-21 03:59:54,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {6087#(and (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} assume !(main_~j~0#1 < 3 * main_~i~0#1); {6091#(and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) 4) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} is VALID [2022-02-21 03:59:54,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {6091#(and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) 4) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6095#(and (<= (div (+ oldRank0 (- 5)) (- 2)) 2) (<= (+ (div (+ oldRank0 (- 5)) (- 2)) 1) |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:54,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {6095#(and (<= (div (+ oldRank0 (- 5)) (- 2)) 2) (<= (+ (div (+ oldRank0 (- 5)) (- 2)) 1) |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {6005#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 5))) unseeded)} is VALID [2022-02-21 03:59:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:54,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:54,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:54,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 18 letters. [2022-02-21 03:59:54,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,353 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2022-02-21 03:59:54,353 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 276 transitions. cyclomatic complexity: 54 Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:54,760 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 276 transitions. cyclomatic complexity: 54. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 888 states and 1072 transitions. Complement of second has 32 states. [2022-02-21 03:59:54,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 15 non-accepting loop states 1 accepting loop states [2022-02-21 03:59:54,761 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:54,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 276 transitions. cyclomatic complexity: 54 [2022-02-21 03:59:54,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:54,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:54,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:54,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-02-21 03:59:54,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:54,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:54,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 888 states and 1072 transitions. [2022-02-21 03:59:54,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2022-02-21 03:59:54,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:54,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:54,765 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 226 states and 276 transitions. cyclomatic complexity: 54 [2022-02-21 03:59:54,767 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 28 examples of accepted words. [2022-02-21 03:59:54,767 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:54,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-02-21 03:59:54,768 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:59:54,768 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 888 states and 1072 transitions. cyclomatic complexity: 192 [2022-02-21 03:59:54,772 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 55 examples of accepted words. [2022-02-21 03:59:54,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 11 letters. Loop has 18 letters. [2022-02-21 03:59:54,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 18 letters. [2022-02-21 03:59:54,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 11 letters. Loop has 18 letters. [2022-02-21 03:59:54,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:59:54,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:59:54,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:59:54,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 11 letters. Loop has 26 letters. [2022-02-21 03:59:54,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 26 letters. [2022-02-21 03:59:54,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 11 letters. Loop has 26 letters. [2022-02-21 03:59:54,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 888 letters. Loop has 888 letters. [2022-02-21 03:59:54,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 888 letters. Loop has 888 letters. [2022-02-21 03:59:54,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 888 letters. Loop has 888 letters. [2022-02-21 03:59:54,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 226 letters. Loop has 226 letters. [2022-02-21 03:59:54,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 226 letters. Loop has 226 letters. [2022-02-21 03:59:54,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 226 letters. Loop has 226 letters. [2022-02-21 03:59:54,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:59:54,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:59:54,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:59:54,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:59:54,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:59:54,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:59:54,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 21 letters. Loop has 15 letters. [2022-02-21 03:59:54,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 15 letters. [2022-02-21 03:59:54,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 21 letters. Loop has 15 letters. [2022-02-21 03:59:54,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:59:54,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:59:54,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:59:54,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:59:54,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:59:54,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:59:54,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 16 letters. Loop has 11 letters. [2022-02-21 03:59:54,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 11 letters. [2022-02-21 03:59:54,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 16 letters. Loop has 11 letters. [2022-02-21 03:59:54,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:59:54,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:59:54,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:59:54,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 27 letters. Loop has 18 letters. [2022-02-21 03:59:54,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 18 letters. [2022-02-21 03:59:54,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 27 letters. Loop has 18 letters. [2022-02-21 03:59:54,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 28 letters. Loop has 18 letters. [2022-02-21 03:59:54,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 18 letters. [2022-02-21 03:59:54,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 28 letters. Loop has 18 letters. [2022-02-21 03:59:54,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 23 letters. Loop has 15 letters. [2022-02-21 03:59:54,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 15 letters. [2022-02-21 03:59:54,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 23 letters. Loop has 15 letters. [2022-02-21 03:59:54,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 24 letters. Loop has 15 letters. [2022-02-21 03:59:54,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 15 letters. [2022-02-21 03:59:54,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 24 letters. Loop has 15 letters. [2022-02-21 03:59:54,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:59:54,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:59:54,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:59:54,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:54,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:59:54,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:59:54,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:59:54,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 22 letters. Loop has 15 letters. [2022-02-21 03:59:54,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 15 letters. [2022-02-21 03:59:54,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 22 letters. Loop has 15 letters. [2022-02-21 03:59:54,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:54,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:54,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:54,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:54,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:54,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:54,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 26 letters. Loop has 15 letters. [2022-02-21 03:59:54,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 15 letters. [2022-02-21 03:59:54,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 26 letters. Loop has 15 letters. [2022-02-21 03:59:54,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:59:54,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:59:54,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:59:54,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 25 letters. Loop has 15 letters. [2022-02-21 03:59:54,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 15 letters. [2022-02-21 03:59:54,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 25 letters. Loop has 15 letters. [2022-02-21 03:59:54,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:59:54,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:59:54,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:59:54,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 28 letters. Loop has 19 letters. [2022-02-21 03:59:54,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 19 letters. [2022-02-21 03:59:54,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 28 letters. Loop has 19 letters. [2022-02-21 03:59:54,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 11 letters. Loop has 18 letters. [2022-02-21 03:59:54,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 18 letters. [2022-02-21 03:59:54,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 11 letters. Loop has 18 letters. [2022-02-21 03:59:54,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 19 letters. Loop has 11 letters. [2022-02-21 03:59:54,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 11 letters. [2022-02-21 03:59:54,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 19 letters. Loop has 11 letters. [2022-02-21 03:59:54,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 20 letters. Loop has 11 letters. [2022-02-21 03:59:54,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 11 letters. [2022-02-21 03:59:54,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 20 letters. Loop has 11 letters. [2022-02-21 03:59:54,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 26 letters. Loop has 19 letters. [2022-02-21 03:59:54,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 19 letters. [2022-02-21 03:59:54,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 26 letters. Loop has 19 letters. [2022-02-21 03:59:54,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:59:54,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:59:54,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:59:54,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 27 letters. Loop has 19 letters. [2022-02-21 03:59:54,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 19 letters. [2022-02-21 03:59:54,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 27 letters. Loop has 19 letters. [2022-02-21 03:59:54,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 18 letters. Loop has 11 letters. [2022-02-21 03:59:54,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 11 letters. [2022-02-21 03:59:54,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 18 letters. Loop has 11 letters. [2022-02-21 03:59:54,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 25 letters. Loop has 19 letters. [2022-02-21 03:59:54,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 19 letters. [2022-02-21 03:59:54,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 25 letters. Loop has 19 letters. [2022-02-21 03:59:54,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:59:54,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:59:54,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:59:54,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 33 letters. Loop has 23 letters. [2022-02-21 03:59:54,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 23 letters. [2022-02-21 03:59:54,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 33 letters. Loop has 23 letters. [2022-02-21 03:59:54,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 13 letters. Loop has 19 letters. [2022-02-21 03:59:54,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 19 letters. [2022-02-21 03:59:54,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 13 letters. Loop has 19 letters. [2022-02-21 03:59:54,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 19 letters. Loop has 11 letters. [2022-02-21 03:59:54,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 11 letters. [2022-02-21 03:59:54,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 19 letters. Loop has 11 letters. [2022-02-21 03:59:54,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:59:54,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:59:54,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:59:54,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 34 letters. Loop has 30 letters. [2022-02-21 03:59:54,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 30 letters. [2022-02-21 03:59:54,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 34 letters. Loop has 30 letters. [2022-02-21 03:59:54,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 34 letters. Loop has 23 letters. [2022-02-21 03:59:54,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 23 letters. [2022-02-21 03:59:54,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 34 letters. Loop has 23 letters. [2022-02-21 03:59:54,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 27 letters. Loop has 11 letters. [2022-02-21 03:59:54,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 11 letters. [2022-02-21 03:59:54,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 27 letters. Loop has 11 letters. [2022-02-21 03:59:54,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 14 letters. Loop has 19 letters. [2022-02-21 03:59:54,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 19 letters. [2022-02-21 03:59:54,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 14 letters. Loop has 19 letters. [2022-02-21 03:59:54,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 27 letters. Loop has 19 letters. [2022-02-21 03:59:54,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 19 letters. [2022-02-21 03:59:54,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 27 letters. Loop has 19 letters. [2022-02-21 03:59:54,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:54,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:54,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:54,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 22 letters. Loop has 19 letters. [2022-02-21 03:59:54,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 19 letters. [2022-02-21 03:59:54,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 22 letters. Loop has 19 letters. [2022-02-21 03:59:54,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:54,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:54,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:59:54,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 30 letters. Loop has 15 letters. [2022-02-21 03:59:54,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 15 letters. [2022-02-21 03:59:54,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 30 letters. Loop has 15 letters. [2022-02-21 03:59:54,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:59:54,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:59:54,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:59:54,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 30 letters. Loop has 19 letters. [2022-02-21 03:59:54,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 19 letters. [2022-02-21 03:59:54,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 30 letters. Loop has 19 letters. [2022-02-21 03:59:54,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 25 letters. Loop has 11 letters. [2022-02-21 03:59:54,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 11 letters. [2022-02-21 03:59:54,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 25 letters. Loop has 11 letters. [2022-02-21 03:59:54,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 25 letters. Loop has 19 letters. [2022-02-21 03:59:54,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 19 letters. [2022-02-21 03:59:54,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 25 letters. Loop has 19 letters. [2022-02-21 03:59:54,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 25 letters. Loop has 15 letters. [2022-02-21 03:59:54,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 15 letters. [2022-02-21 03:59:54,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 25 letters. Loop has 15 letters. [2022-02-21 03:59:54,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 15 letters. Loop has 19 letters. [2022-02-21 03:59:54,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 19 letters. [2022-02-21 03:59:54,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 15 letters. Loop has 19 letters. [2022-02-21 03:59:54,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 35 letters. Loop has 30 letters. [2022-02-21 03:59:54,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 30 letters. [2022-02-21 03:59:54,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 35 letters. Loop has 30 letters. [2022-02-21 03:59:54,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 35 letters. Loop has 26 letters. [2022-02-21 03:59:54,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 26 letters. [2022-02-21 03:59:54,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 35 letters. Loop has 26 letters. [2022-02-21 03:59:54,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 20 letters. Loop has 11 letters. [2022-02-21 03:59:54,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 11 letters. [2022-02-21 03:59:54,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 20 letters. Loop has 11 letters. [2022-02-21 03:59:54,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 20 letters. Loop has 19 letters. [2022-02-21 03:59:54,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 19 letters. [2022-02-21 03:59:54,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 20 letters. Loop has 19 letters. [2022-02-21 03:59:54,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 16 letters. Loop has 19 letters. [2022-02-21 03:59:54,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 19 letters. [2022-02-21 03:59:54,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 16 letters. Loop has 19 letters. [2022-02-21 03:59:54,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 28 letters. Loop has 15 letters. [2022-02-21 03:59:54,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 15 letters. [2022-02-21 03:59:54,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 28 letters. Loop has 15 letters. [2022-02-21 03:59:54,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 28 letters. Loop has 19 letters. [2022-02-21 03:59:54,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 19 letters. [2022-02-21 03:59:54,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 28 letters. Loop has 19 letters. [2022-02-21 03:59:54,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 31 letters. Loop has 15 letters. [2022-02-21 03:59:54,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 15 letters. [2022-02-21 03:59:54,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 31 letters. Loop has 15 letters. [2022-02-21 03:59:54,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 23 letters. Loop has 11 letters. [2022-02-21 03:59:54,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 11 letters. [2022-02-21 03:59:54,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 23 letters. Loop has 11 letters. [2022-02-21 03:59:54,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:59:54,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:59:54,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:59:54,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 23 letters. Loop has 19 letters. [2022-02-21 03:59:54,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 19 letters. [2022-02-21 03:59:54,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 23 letters. Loop has 19 letters. [2022-02-21 03:59:54,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:59:54,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:59:54,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:59:54,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 36 letters. Loop has 30 letters. [2022-02-21 03:59:54,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 30 letters. [2022-02-21 03:59:54,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 36 letters. Loop has 30 letters. [2022-02-21 03:59:54,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 36 letters. Loop has 26 letters. [2022-02-21 03:59:54,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 26 letters. [2022-02-21 03:59:54,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 36 letters. Loop has 26 letters. [2022-02-21 03:59:54,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 17 letters. Loop has 19 letters. [2022-02-21 03:59:54,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 19 letters. [2022-02-21 03:59:54,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 17 letters. Loop has 19 letters. [2022-02-21 03:59:54,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 26 letters. Loop has 11 letters. [2022-02-21 03:59:54,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 11 letters. [2022-02-21 03:59:54,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 26 letters. Loop has 11 letters. [2022-02-21 03:59:54,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 26 letters. Loop has 19 letters. [2022-02-21 03:59:54,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 19 letters. [2022-02-21 03:59:54,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 26 letters. Loop has 19 letters. [2022-02-21 03:59:54,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 26 letters. Loop has 15 letters. [2022-02-21 03:59:54,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 15 letters. [2022-02-21 03:59:54,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 26 letters. Loop has 15 letters. [2022-02-21 03:59:54,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:54,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:54,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:54,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 21 letters. Loop has 19 letters. [2022-02-21 03:59:54,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 19 letters. [2022-02-21 03:59:54,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 21 letters. Loop has 19 letters. [2022-02-21 03:59:54,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:59:54,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:59:54,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:59:54,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:54,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:54,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:59:54,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 32 letters. Loop has 30 letters. [2022-02-21 03:59:54,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 30 letters. [2022-02-21 03:59:54,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 32 letters. Loop has 30 letters. [2022-02-21 03:59:54,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:59:54,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:59:54,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 32 letters. Loop has 4 letters. [2022-02-21 03:59:54,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 11 letters. Loop has 26 letters. [2022-02-21 03:59:54,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 26 letters. [2022-02-21 03:59:54,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 11 letters. Loop has 26 letters. [2022-02-21 03:59:54,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:59:54,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:59:54,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:59:54,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 29 letters. Loop has 15 letters. [2022-02-21 03:59:54,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 15 letters. [2022-02-21 03:59:54,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 29 letters. Loop has 15 letters. [2022-02-21 03:59:54,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:59:54,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:59:54,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:59:54,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 18 letters. Loop has 19 letters. [2022-02-21 03:59:54,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 19 letters. [2022-02-21 03:59:54,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 18 letters. Loop has 19 letters. [2022-02-21 03:59:54,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 29 letters. Loop has 19 letters. [2022-02-21 03:59:54,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 19 letters. [2022-02-21 03:59:54,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 29 letters. Loop has 19 letters. [2022-02-21 03:59:54,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 24 letters. Loop has 11 letters. [2022-02-21 03:59:54,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 11 letters. [2022-02-21 03:59:54,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 24 letters. Loop has 11 letters. [2022-02-21 03:59:54,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 24 letters. Loop has 19 letters. [2022-02-21 03:59:54,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 19 letters. [2022-02-21 03:59:54,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 24 letters. Loop has 19 letters. [2022-02-21 03:59:54,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:59:54,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:59:54,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:59:54,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 12 letters. Loop has 19 letters. [2022-02-21 03:59:54,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 19 letters. [2022-02-21 03:59:54,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 12 letters. Loop has 19 letters. [2022-02-21 03:59:54,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 40 letters. Loop has 33 letters. [2022-02-21 03:59:54,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 33 letters. [2022-02-21 03:59:54,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 40 letters. Loop has 33 letters. [2022-02-21 03:59:54,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 226 states and 276 transitions. cyclomatic complexity: 54 Stem has 33 letters. Loop has 30 letters. [2022-02-21 03:59:54,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 30 letters. [2022-02-21 03:59:54,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1072 transitions. cyclomatic complexity: 192 Stem has 33 letters. Loop has 30 letters. [2022-02-21 03:59:54,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,909 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 71 transitions. [2022-02-21 03:59:54,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 71 transitions. Stem has 11 letters. Loop has 18 letters. [2022-02-21 03:59:54,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 71 transitions. Stem has 29 letters. Loop has 18 letters. [2022-02-21 03:59:54,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 71 transitions. Stem has 11 letters. Loop has 36 letters. [2022-02-21 03:59:54,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:54,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 888 states and 1072 transitions. cyclomatic complexity: 192 [2022-02-21 03:59:54,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2022-02-21 03:59:54,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 888 states to 666 states and 803 transitions. [2022-02-21 03:59:54,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2022-02-21 03:59:54,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2022-02-21 03:59:54,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 666 states and 803 transitions. [2022-02-21 03:59:54,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:59:54,966 INFO L681 BuchiCegarLoop]: Abstraction has 666 states and 803 transitions. [2022-02-21 03:59:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states and 803 transitions. [2022-02-21 03:59:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 340. [2022-02-21 03:59:54,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:59:54,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 666 states and 803 transitions. Second operand has 340 states, 340 states have (on average 1.2323529411764707) internal successors, (419), 339 states have internal predecessors, (419), 0 states have call successors, (0), 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:59:54,974 INFO L74 IsIncluded]: Start isIncluded. First operand 666 states and 803 transitions. Second operand has 340 states, 340 states have (on average 1.2323529411764707) internal successors, (419), 339 states have internal predecessors, (419), 0 states have call successors, (0), 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:59:54,974 INFO L87 Difference]: Start difference. First operand 666 states and 803 transitions. Second operand has 340 states, 340 states have (on average 1.2323529411764707) internal successors, (419), 339 states have internal predecessors, (419), 0 states have call successors, (0), 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:59:54,974 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:54,997 INFO L93 Difference]: Finished difference Result 753 states and 917 transitions. [2022-02-21 03:59:54,997 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 917 transitions. [2022-02-21 03:59:54,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:54,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:54,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 340 states, 340 states have (on average 1.2323529411764707) internal successors, (419), 339 states have internal predecessors, (419), 0 states have call successors, (0), 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 666 states and 803 transitions. [2022-02-21 03:59:55,000 INFO L87 Difference]: Start difference. First operand has 340 states, 340 states have (on average 1.2323529411764707) internal successors, (419), 339 states have internal predecessors, (419), 0 states have call successors, (0), 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 666 states and 803 transitions. [2022-02-21 03:59:55,000 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:55,022 INFO L93 Difference]: Finished difference Result 753 states and 917 transitions. [2022-02-21 03:59:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 917 transitions. [2022-02-21 03:59:55,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:55,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:55,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:59:55,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:59:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 340 states have (on average 1.2323529411764707) internal successors, (419), 339 states have internal predecessors, (419), 0 states have call successors, (0), 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:59:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 419 transitions. [2022-02-21 03:59:55,029 INFO L704 BuchiCegarLoop]: Abstraction has 340 states and 419 transitions. [2022-02-21 03:59:55,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:59:55,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:59:55,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:59:55,030 INFO L87 Difference]: Start difference. First operand 340 states and 419 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 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:59:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:59:55,545 INFO L93 Difference]: Finished difference Result 882 states and 1060 transitions. [2022-02-21 03:59:55,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-21 03:59:55,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 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:59:55,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:55,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 882 states and 1060 transitions. [2022-02-21 03:59:55,607 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 77 [2022-02-21 03:59:55,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 882 states to 814 states and 980 transitions. [2022-02-21 03:59:55,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2022-02-21 03:59:55,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-02-21 03:59:55,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 814 states and 980 transitions. [2022-02-21 03:59:55,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:59:55,629 INFO L681 BuchiCegarLoop]: Abstraction has 814 states and 980 transitions. [2022-02-21 03:59:55,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states and 980 transitions. [2022-02-21 03:59:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 485. [2022-02-21 03:59:55,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:59:55,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 814 states and 980 transitions. Second operand has 485 states, 485 states have (on average 1.2185567010309277) internal successors, (591), 484 states have internal predecessors, (591), 0 states have call successors, (0), 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:59:55,638 INFO L74 IsIncluded]: Start isIncluded. First operand 814 states and 980 transitions. Second operand has 485 states, 485 states have (on average 1.2185567010309277) internal successors, (591), 484 states have internal predecessors, (591), 0 states have call successors, (0), 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:59:55,638 INFO L87 Difference]: Start difference. First operand 814 states and 980 transitions. Second operand has 485 states, 485 states have (on average 1.2185567010309277) internal successors, (591), 484 states have internal predecessors, (591), 0 states have call successors, (0), 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:59:55,639 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:55,666 INFO L93 Difference]: Finished difference Result 1076 states and 1291 transitions. [2022-02-21 03:59:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1291 transitions. [2022-02-21 03:59:55,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:55,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:55,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 485 states, 485 states have (on average 1.2185567010309277) internal successors, (591), 484 states have internal predecessors, (591), 0 states have call successors, (0), 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 814 states and 980 transitions. [2022-02-21 03:59:55,669 INFO L87 Difference]: Start difference. First operand has 485 states, 485 states have (on average 1.2185567010309277) internal successors, (591), 484 states have internal predecessors, (591), 0 states have call successors, (0), 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 814 states and 980 transitions. [2022-02-21 03:59:55,670 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:55,699 INFO L93 Difference]: Finished difference Result 1076 states and 1291 transitions. [2022-02-21 03:59:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1291 transitions. [2022-02-21 03:59:55,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:55,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:55,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:59:55,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:59:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 485 states have (on average 1.2185567010309277) internal successors, (591), 484 states have internal predecessors, (591), 0 states have call successors, (0), 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:59:55,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 591 transitions. [2022-02-21 03:59:55,709 INFO L704 BuchiCegarLoop]: Abstraction has 485 states and 591 transitions. [2022-02-21 03:59:55,709 INFO L587 BuchiCegarLoop]: Abstraction has 485 states and 591 transitions. [2022-02-21 03:59:55,709 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:59:55,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 485 states and 591 transitions. [2022-02-21 03:59:55,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2022-02-21 03:59:55,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:55,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:55,711 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:55,711 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2022-02-21 03:59:55,711 INFO L791 eck$LassoCheckResult]: Stem: 9959#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(9, 2);~__BLAST_NONDET~0 := 0; 9960#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 9961#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 9962#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 9966#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 9965#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 9963#L33-1 main_~i~0#1 := 0; 9964#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 10054#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 10053#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 10050#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 10048#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 10031#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 10045#L18 assume !(0 == __VERIFIER_assert_~cond#1); 10043#L18-2 assume { :end_inline___VERIFIER_assert } true; 10040#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 10038#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 10034#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10030#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 10028#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 10023#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 10022#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 10021#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 10088#L18 assume !(0 == __VERIFIER_assert_~cond#1); 10087#L18-2 assume { :end_inline___VERIFIER_assert } true; 10086#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 10066#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 10062#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10055#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 9967#L36-3 [2022-02-21 03:59:55,711 INFO L793 eck$LassoCheckResult]: Loop: 9967#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 9968#L18 assume !(0 == __VERIFIER_assert_~cond#1); 9983#L18-2 assume { :end_inline___VERIFIER_assert } true; 9986#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 10012#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 10011#L18 assume !(0 == __VERIFIER_assert_~cond#1); 10010#L18-2 assume { :end_inline___VERIFIER_assert } true; 10009#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 10008#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 9988#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9989#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 9967#L36-3 [2022-02-21 03:59:55,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:55,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1334545203, now seen corresponding path program 4 times [2022-02-21 03:59:55,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:55,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006072524] [2022-02-21 03:59:55,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:55,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:55,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {12829#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(9, 2);~__BLAST_NONDET~0 := 0; {12829#true} is VALID [2022-02-21 03:59:55,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {12829#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {12829#true} is VALID [2022-02-21 03:59:55,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {12829#true} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {12829#true} is VALID [2022-02-21 03:59:55,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {12829#true} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {12829#true} is VALID [2022-02-21 03:59:55,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {12829#true} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {12829#true} is VALID [2022-02-21 03:59:55,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {12829#true} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {12829#true} is VALID [2022-02-21 03:59:55,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {12829#true} main_~i~0#1 := 0; {12831#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:55,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {12831#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {12831#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:55,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {12831#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < 3 * main_~i~0#1); {12831#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:55,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {12831#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:55,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:55,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:55,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:55,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(0 == __VERIFIER_assert_~cond#1); {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:55,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline___VERIFIER_assert } true; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:55,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:55,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~k~0#1 < main_~j~0#1); {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:55,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:55,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~j~0#1 < 3 * main_~i~0#1); {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:55,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12833#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:55,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {12833#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {12834#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:59:55,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {12834#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {12835#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:59:55,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {12835#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {12835#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:59:55,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {12835#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|)} assume !(0 == __VERIFIER_assert_~cond#1); {12835#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:59:55,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {12835#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|)} assume { :end_inline___VERIFIER_assert } true; {12835#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:59:55,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {12835#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|)} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {12836#(<= (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:59:55,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {12836#(<= (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|)} assume !(main_~k~0#1 < main_~j~0#1); {12830#false} is VALID [2022-02-21 03:59:55,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {12830#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {12830#false} is VALID [2022-02-21 03:59:55,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {12830#false} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {12830#false} is VALID [2022-02-21 03:59:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:59:55,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:59:55,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006072524] [2022-02-21 03:59:55,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006072524] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:59:55,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195422000] [2022-02-21 03:59:55,805 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:59:55,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:59:55,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:55,806 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:59:55,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-02-21 03:59:55,835 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:59:55,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:59:55,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:59:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:55,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:56,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {12829#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(9, 2);~__BLAST_NONDET~0 := 0; {12829#true} is VALID [2022-02-21 03:59:56,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {12829#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {12829#true} is VALID [2022-02-21 03:59:56,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {12829#true} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {12829#true} is VALID [2022-02-21 03:59:56,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {12829#true} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {12829#true} is VALID [2022-02-21 03:59:56,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {12829#true} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {12829#true} is VALID [2022-02-21 03:59:56,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {12829#true} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {12829#true} is VALID [2022-02-21 03:59:56,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {12829#true} main_~i~0#1 := 0; {12858#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {12858#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {12858#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {12858#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~j~0#1 < 3 * main_~i~0#1); {12858#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {12858#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(0 == __VERIFIER_assert_~cond#1); {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline___VERIFIER_assert } true; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~k~0#1 < main_~j~0#1); {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~j~0#1 < 3 * main_~i~0#1); {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12833#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {12833#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {12901#(and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:56,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {12901#(and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {12905#(and (<= |ULTIMATE.start_main_~k~0#1| (div |ULTIMATE.start_main_~j~0#1| 2)) (<= 2 (div |ULTIMATE.start_main_~j~0#1| 2)))} is VALID [2022-02-21 03:59:56,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {12905#(and (<= |ULTIMATE.start_main_~k~0#1| (div |ULTIMATE.start_main_~j~0#1| 2)) (<= 2 (div |ULTIMATE.start_main_~j~0#1| 2)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {12905#(and (<= |ULTIMATE.start_main_~k~0#1| (div |ULTIMATE.start_main_~j~0#1| 2)) (<= 2 (div |ULTIMATE.start_main_~j~0#1| 2)))} is VALID [2022-02-21 03:59:56,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {12905#(and (<= |ULTIMATE.start_main_~k~0#1| (div |ULTIMATE.start_main_~j~0#1| 2)) (<= 2 (div |ULTIMATE.start_main_~j~0#1| 2)))} assume !(0 == __VERIFIER_assert_~cond#1); {12905#(and (<= |ULTIMATE.start_main_~k~0#1| (div |ULTIMATE.start_main_~j~0#1| 2)) (<= 2 (div |ULTIMATE.start_main_~j~0#1| 2)))} is VALID [2022-02-21 03:59:56,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {12905#(and (<= |ULTIMATE.start_main_~k~0#1| (div |ULTIMATE.start_main_~j~0#1| 2)) (<= 2 (div |ULTIMATE.start_main_~j~0#1| 2)))} assume { :end_inline___VERIFIER_assert } true; {12905#(and (<= |ULTIMATE.start_main_~k~0#1| (div |ULTIMATE.start_main_~j~0#1| 2)) (<= 2 (div |ULTIMATE.start_main_~j~0#1| 2)))} is VALID [2022-02-21 03:59:56,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {12905#(and (<= |ULTIMATE.start_main_~k~0#1| (div |ULTIMATE.start_main_~j~0#1| 2)) (<= 2 (div |ULTIMATE.start_main_~j~0#1| 2)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {12918#(and (<= |ULTIMATE.start_main_~k~0#1| (+ (div |ULTIMATE.start_main_~j~0#1| 2) 1)) (<= 2 (div |ULTIMATE.start_main_~j~0#1| 2)))} is VALID [2022-02-21 03:59:56,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {12918#(and (<= |ULTIMATE.start_main_~k~0#1| (+ (div |ULTIMATE.start_main_~j~0#1| 2) 1)) (<= 2 (div |ULTIMATE.start_main_~j~0#1| 2)))} assume !(main_~k~0#1 < main_~j~0#1); {12830#false} is VALID [2022-02-21 03:59:56,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {12830#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {12830#false} is VALID [2022-02-21 03:59:56,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {12830#false} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {12830#false} is VALID [2022-02-21 03:59:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:59:56,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:59:56,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {12830#false} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {12830#false} is VALID [2022-02-21 03:59:56,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {12830#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {12830#false} is VALID [2022-02-21 03:59:56,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {12836#(<= (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|)} assume !(main_~k~0#1 < main_~j~0#1); {12830#false} is VALID [2022-02-21 03:59:56,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {12835#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|)} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {12836#(<= (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:59:56,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {12835#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|)} assume { :end_inline___VERIFIER_assert } true; {12835#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:59:56,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {12835#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|)} assume !(0 == __VERIFIER_assert_~cond#1); {12835#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:59:56,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {12835#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {12835#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:59:56,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {12834#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {12835#(<= (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:59:56,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {12833#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {12834#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:59:56,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12833#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~j~0#1 < 3 * main_~i~0#1); {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~k~0#1 < main_~j~0#1); {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline___VERIFIER_assert } true; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(0 == __VERIFIER_assert_~cond#1); {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {12858#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12832#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {12858#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~j~0#1 < 3 * main_~i~0#1); {12858#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {12858#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {12858#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {12829#true} main_~i~0#1 := 0; {12858#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:59:56,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {12829#true} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {12829#true} is VALID [2022-02-21 03:59:56,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {12829#true} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {12829#true} is VALID [2022-02-21 03:59:56,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {12829#true} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {12829#true} is VALID [2022-02-21 03:59:56,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {12829#true} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {12829#true} is VALID [2022-02-21 03:59:56,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {12829#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {12829#true} is VALID [2022-02-21 03:59:56,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {12829#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(9, 2);~__BLAST_NONDET~0 := 0; {12829#true} is VALID [2022-02-21 03:59:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:59:56,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195422000] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:59:56,452 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:59:56,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-02-21 03:59:56,468 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748027738] [2022-02-21 03:59:56,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:59:56,468 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:59:56,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:56,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1426778589, now seen corresponding path program 2 times [2022-02-21 03:59:56,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:56,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963424836] [2022-02-21 03:59:56,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:56,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:56,474 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:56,478 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:56,545 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:56,545 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:56,545 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:56,545 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:56,545 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:59:56,545 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:56,545 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:56,546 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:56,546 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration9_Loop [2022-02-21 03:59:56,546 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:56,546 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:56,546 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:59:56,548 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:59:56,554 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:59:56,555 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:59:56,601 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:56,601 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:59:56,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:56,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:56,609 INFO L229 MonitoredProcess]: Starting monitored process 49 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:59:56,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 03:59:56,611 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:56,611 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:56,618 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:59:56,618 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:59:56,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:56,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:56,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:56,636 INFO L229 MonitoredProcess]: Starting monitored process 50 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:59:56,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 03:59:56,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:56,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:56,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:56,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:56,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:56,677 INFO L229 MonitoredProcess]: Starting monitored process 51 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:59:56,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 03:59:56,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:59:56,681 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:57,070 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:59:57,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:57,074 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:57,074 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:57,074 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:57,074 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:57,074 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:59:57,074 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:57,074 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:57,074 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:57,074 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration9_Loop [2022-02-21 03:59:57,074 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:57,074 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:57,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:57,077 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:59:57,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:59:57,085 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:59:57,133 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:57,134 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:59:57,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:57,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:57,135 INFO L229 MonitoredProcess]: Starting monitored process 52 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:59:57,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 03:59:57,137 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:59:57,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:57,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:57,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:57,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:57,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:57,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:57,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:57,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:59:57,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-02-21 03:59:57,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:57,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:57,175 INFO L229 MonitoredProcess]: Starting monitored process 53 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:59:57,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 03:59:57,177 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:59:57,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:57,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:57,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:57,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:57,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:57,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:57,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:57,187 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:59:57,194 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:59:57,195 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:59:57,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:57,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:57,197 INFO L229 MonitoredProcess]: Starting monitored process 54 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:59:57,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 03:59:57,198 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:59:57,198 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:59:57,198 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:59:57,198 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~j~0#1) = 3*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-02-21 03:59:57,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:57,218 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:59:57,221 INFO L390 LassoCheck]: Loop: "assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "assume { :end_inline___VERIFIER_assert } true;" "main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "assume { :end_inline___VERIFIER_assert } true;" "main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~k~0#1 < main_~j~0#1);" "main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1;" [2022-02-21 03:59:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:57,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:57,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:59:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:57,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:57,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {13011#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(9, 2);~__BLAST_NONDET~0 := 0; {13011#unseeded} is VALID [2022-02-21 03:59:57,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {13011#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {13011#unseeded} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {13011#unseeded} is VALID [2022-02-21 03:59:57,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {13011#unseeded} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {13011#unseeded} is VALID [2022-02-21 03:59:57,307 INFO L290 TraceCheckUtils]: 4: Hoare triple {13011#unseeded} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {13011#unseeded} is VALID [2022-02-21 03:59:57,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {13011#unseeded} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {13011#unseeded} main_~i~0#1 := 0; {13011#unseeded} is VALID [2022-02-21 03:59:57,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {13011#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {13011#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {13011#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {13011#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {13011#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {13011#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {13011#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {13011#unseeded} assume { :end_inline___VERIFIER_assert } true; {13011#unseeded} is VALID [2022-02-21 03:59:57,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {13011#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {13011#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {13011#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {13011#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {13011#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {13011#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {13011#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {13011#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {13011#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {13011#unseeded} assume { :end_inline___VERIFIER_assert } true; {13011#unseeded} is VALID [2022-02-21 03:59:57,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {13011#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {13011#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {13011#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {13011#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:57,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:59:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:57,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:57,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,374 INFO L290 TraceCheckUtils]: 3: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,374 INFO L290 TraceCheckUtils]: 4: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !(main_~k~0#1 < main_~j~0#1); {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {13140#(<= (+ (* 3 |ULTIMATE.start_main_~i~0#1|) 1) (+ |ULTIMATE.start_main_~j~0#1| oldRank0))} is VALID [2022-02-21 03:59:57,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {13140#(<= (+ (* 3 |ULTIMATE.start_main_~i~0#1|) 1) (+ |ULTIMATE.start_main_~j~0#1| oldRank0))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {13024#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))))} is VALID [2022-02-21 03:59:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-21 03:59:57,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:57,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:57,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,383 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:59:57,384 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 485 states and 591 transitions. cyclomatic complexity: 118 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:57,422 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 485 states and 591 transitions. cyclomatic complexity: 118. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 499 states and 605 transitions. Complement of second has 7 states. [2022-02-21 03:59:57,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:59:57,435 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:57,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 485 states and 591 transitions. cyclomatic complexity: 118 [2022-02-21 03:59:57,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:57,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:57,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:57,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:59:57,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:57,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:57,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 499 states and 605 transitions. [2022-02-21 03:59:57,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2022-02-21 03:59:57,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:57,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:57,438 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 485 states and 591 transitions. cyclomatic complexity: 118 [2022-02-21 03:59:57,441 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 28 examples of accepted words. [2022-02-21 03:59:57,441 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:57,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:59:57,441 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:59:57,441 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 499 states and 605 transitions. cyclomatic complexity: 118 [2022-02-21 03:59:57,444 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 28 examples of accepted words. [2022-02-21 03:59:57,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:57,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:57,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:57,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 499 letters. Loop has 499 letters. [2022-02-21 03:59:57,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 499 letters. Loop has 499 letters. [2022-02-21 03:59:57,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 499 letters. Loop has 499 letters. [2022-02-21 03:59:57,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 485 letters. Loop has 485 letters. [2022-02-21 03:59:57,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 485 letters. Loop has 485 letters. [2022-02-21 03:59:57,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 485 letters. Loop has 485 letters. [2022-02-21 03:59:57,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:59:57,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:59:57,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:59:57,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:57,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:57,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:57,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 51 letters. Loop has 23 letters. [2022-02-21 03:59:57,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 23 letters. [2022-02-21 03:59:57,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 51 letters. Loop has 23 letters. [2022-02-21 03:59:57,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 50 letters. Loop has 23 letters. [2022-02-21 03:59:57,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 23 letters. [2022-02-21 03:59:57,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 50 letters. Loop has 23 letters. [2022-02-21 03:59:57,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:57,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:57,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:57,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:57,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:57,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:57,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:57,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:57,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:57,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:57,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:57,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:57,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 45 letters. Loop has 19 letters. [2022-02-21 03:59:57,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 19 letters. [2022-02-21 03:59:57,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 45 letters. Loop has 19 letters. [2022-02-21 03:59:57,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 44 letters. Loop has 19 letters. [2022-02-21 03:59:57,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 19 letters. [2022-02-21 03:59:57,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 44 letters. Loop has 19 letters. [2022-02-21 03:59:57,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 43 letters. Loop has 19 letters. [2022-02-21 03:59:57,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 19 letters. [2022-02-21 03:59:57,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 43 letters. Loop has 19 letters. [2022-02-21 03:59:57,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 42 letters. Loop has 19 letters. [2022-02-21 03:59:57,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 19 letters. [2022-02-21 03:59:57,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 42 letters. Loop has 19 letters. [2022-02-21 03:59:57,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 41 letters. Loop has 15 letters. [2022-02-21 03:59:57,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 15 letters. [2022-02-21 03:59:57,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 41 letters. Loop has 15 letters. [2022-02-21 03:59:57,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 40 letters. Loop has 15 letters. [2022-02-21 03:59:57,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 15 letters. [2022-02-21 03:59:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 40 letters. Loop has 15 letters. [2022-02-21 03:59:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 39 letters. Loop has 15 letters. [2022-02-21 03:59:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 15 letters. [2022-02-21 03:59:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 39 letters. Loop has 15 letters. [2022-02-21 03:59:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 38 letters. Loop has 15 letters. [2022-02-21 03:59:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 15 letters. [2022-02-21 03:59:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 38 letters. Loop has 15 letters. [2022-02-21 03:59:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 37 letters. Loop has 11 letters. [2022-02-21 03:59:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 11 letters. [2022-02-21 03:59:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 37 letters. Loop has 11 letters. [2022-02-21 03:59:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 36 letters. Loop has 11 letters. [2022-02-21 03:59:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 11 letters. [2022-02-21 03:59:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 36 letters. Loop has 11 letters. [2022-02-21 03:59:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 35 letters. Loop has 11 letters. [2022-02-21 03:59:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 11 letters. [2022-02-21 03:59:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 35 letters. Loop has 11 letters. [2022-02-21 03:59:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 11 letters. [2022-02-21 03:59:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 11 letters. [2022-02-21 03:59:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 11 letters. [2022-02-21 03:59:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 33 letters. Loop has 11 letters. [2022-02-21 03:59:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 11 letters. [2022-02-21 03:59:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 33 letters. Loop has 11 letters. [2022-02-21 03:59:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 30 letters. Loop has 11 letters. [2022-02-21 03:59:57,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 11 letters. [2022-02-21 03:59:57,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 30 letters. Loop has 11 letters. [2022-02-21 03:59:57,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:57,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:57,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:57,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:57,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:57,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:57,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:57,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:57,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:57,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 11 letters. [2022-02-21 03:59:57,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 11 letters. [2022-02-21 03:59:57,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 11 letters. [2022-02-21 03:59:57,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 50 letters. Loop has 23 letters. [2022-02-21 03:59:57,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 23 letters. [2022-02-21 03:59:57,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 50 letters. Loop has 23 letters. [2022-02-21 03:59:57,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 51 letters. Loop has 23 letters. [2022-02-21 03:59:57,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 23 letters. [2022-02-21 03:59:57,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 51 letters. Loop has 23 letters. [2022-02-21 03:59:57,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:57,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:57,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:57,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 43 letters. Loop has 19 letters. [2022-02-21 03:59:57,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 19 letters. [2022-02-21 03:59:57,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 43 letters. Loop has 19 letters. [2022-02-21 03:59:57,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 38 letters. Loop has 15 letters. [2022-02-21 03:59:57,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 15 letters. [2022-02-21 03:59:57,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 38 letters. Loop has 15 letters. [2022-02-21 03:59:57,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:57,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:57,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:57,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:57,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:57,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:57,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 35 letters. Loop has 11 letters. [2022-02-21 03:59:57,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 11 letters. [2022-02-21 03:59:57,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 35 letters. Loop has 11 letters. [2022-02-21 03:59:57,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 39 letters. Loop has 15 letters. [2022-02-21 03:59:57,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 15 letters. [2022-02-21 03:59:57,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 39 letters. Loop has 15 letters. [2022-02-21 03:59:57,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 44 letters. Loop has 19 letters. [2022-02-21 03:59:57,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 19 letters. [2022-02-21 03:59:57,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 44 letters. Loop has 19 letters. [2022-02-21 03:59:57,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 30 letters. Loop has 11 letters. [2022-02-21 03:59:57,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 11 letters. [2022-02-21 03:59:57,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 30 letters. Loop has 11 letters. [2022-02-21 03:59:57,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 40 letters. Loop has 15 letters. [2022-02-21 03:59:57,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 15 letters. [2022-02-21 03:59:57,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 40 letters. Loop has 15 letters. [2022-02-21 03:59:57,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 45 letters. Loop has 19 letters. [2022-02-21 03:59:57,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 19 letters. [2022-02-21 03:59:57,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 45 letters. Loop has 19 letters. [2022-02-21 03:59:57,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 36 letters. Loop has 11 letters. [2022-02-21 03:59:57,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 11 letters. [2022-02-21 03:59:57,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 36 letters. Loop has 11 letters. [2022-02-21 03:59:57,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 33 letters. Loop has 11 letters. [2022-02-21 03:59:57,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 11 letters. [2022-02-21 03:59:57,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 33 letters. Loop has 11 letters. [2022-02-21 03:59:57,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:57,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:57,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:57,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 41 letters. Loop has 15 letters. [2022-02-21 03:59:57,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 15 letters. [2022-02-21 03:59:57,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 41 letters. Loop has 15 letters. [2022-02-21 03:59:57,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:57,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:57,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:57,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:57,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:57,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:57,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 37 letters. Loop has 11 letters. [2022-02-21 03:59:57,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 11 letters. [2022-02-21 03:59:57,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 37 letters. Loop has 11 letters. [2022-02-21 03:59:57,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 42 letters. Loop has 19 letters. [2022-02-21 03:59:57,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 19 letters. [2022-02-21 03:59:57,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 42 letters. Loop has 19 letters. [2022-02-21 03:59:57,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:57,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:57,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:57,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,549 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:57,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-02-21 03:59:57,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,550 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:59:57,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:57,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:59:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:57,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:57,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {13011#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(9, 2);~__BLAST_NONDET~0 := 0; {13011#unseeded} is VALID [2022-02-21 03:59:57,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {13011#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {13011#unseeded} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {13011#unseeded} is VALID [2022-02-21 03:59:57,606 INFO L290 TraceCheckUtils]: 3: Hoare triple {13011#unseeded} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {13011#unseeded} is VALID [2022-02-21 03:59:57,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {13011#unseeded} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {13011#unseeded} is VALID [2022-02-21 03:59:57,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {13011#unseeded} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {13011#unseeded} main_~i~0#1 := 0; {13011#unseeded} is VALID [2022-02-21 03:59:57,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {13011#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {13011#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {13011#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {13011#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {13011#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {13011#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {13011#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {13011#unseeded} assume { :end_inline___VERIFIER_assert } true; {13011#unseeded} is VALID [2022-02-21 03:59:57,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {13011#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {13011#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {13011#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {13011#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {13011#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {13011#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {13011#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {13011#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {13011#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {13011#unseeded} assume { :end_inline___VERIFIER_assert } true; {13011#unseeded} is VALID [2022-02-21 03:59:57,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {13011#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {13011#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {13011#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {13011#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:57,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:59:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:57,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:57,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:57,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,701 INFO L290 TraceCheckUtils]: 3: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,701 INFO L290 TraceCheckUtils]: 4: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !(main_~k~0#1 < main_~j~0#1); {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {13768#(<= (+ (* 3 |ULTIMATE.start_main_~i~0#1|) 1) (+ |ULTIMATE.start_main_~j~0#1| oldRank0))} is VALID [2022-02-21 03:59:57,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {13768#(<= (+ (* 3 |ULTIMATE.start_main_~i~0#1|) 1) (+ |ULTIMATE.start_main_~j~0#1| oldRank0))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {13024#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))))} is VALID [2022-02-21 03:59:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-21 03:59:57,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:57,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:57,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,711 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:59:57,711 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 485 states and 591 transitions. cyclomatic complexity: 118 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:57,745 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 485 states and 591 transitions. cyclomatic complexity: 118. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 499 states and 605 transitions. Complement of second has 7 states. [2022-02-21 03:59:57,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:59:57,746 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:57,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 485 states and 591 transitions. cyclomatic complexity: 118 [2022-02-21 03:59:57,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:57,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:57,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:57,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:59:57,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:57,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:57,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 499 states and 605 transitions. [2022-02-21 03:59:57,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2022-02-21 03:59:57,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:57,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:57,748 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 485 states and 591 transitions. cyclomatic complexity: 118 [2022-02-21 03:59:57,748 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 28 examples of accepted words. [2022-02-21 03:59:57,748 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:57,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:59:57,748 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:59:57,748 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 499 states and 605 transitions. cyclomatic complexity: 118 [2022-02-21 03:59:57,750 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 28 examples of accepted words. [2022-02-21 03:59:57,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:57,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:57,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:57,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 499 letters. Loop has 499 letters. [2022-02-21 03:59:57,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 499 letters. Loop has 499 letters. [2022-02-21 03:59:57,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 499 letters. Loop has 499 letters. [2022-02-21 03:59:57,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 485 letters. Loop has 485 letters. [2022-02-21 03:59:57,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 485 letters. Loop has 485 letters. [2022-02-21 03:59:57,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 485 letters. Loop has 485 letters. [2022-02-21 03:59:57,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:59:57,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:59:57,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:59:57,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:57,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:57,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:57,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 51 letters. Loop has 23 letters. [2022-02-21 03:59:57,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 23 letters. [2022-02-21 03:59:57,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 51 letters. Loop has 23 letters. [2022-02-21 03:59:57,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 50 letters. Loop has 23 letters. [2022-02-21 03:59:57,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 23 letters. [2022-02-21 03:59:57,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 50 letters. Loop has 23 letters. [2022-02-21 03:59:57,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:57,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:57,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:57,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:57,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:57,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:57,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:57,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:57,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:57,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:57,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:57,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:57,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 45 letters. Loop has 19 letters. [2022-02-21 03:59:57,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 19 letters. [2022-02-21 03:59:57,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 45 letters. Loop has 19 letters. [2022-02-21 03:59:57,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 44 letters. Loop has 19 letters. [2022-02-21 03:59:57,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 19 letters. [2022-02-21 03:59:57,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 44 letters. Loop has 19 letters. [2022-02-21 03:59:57,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 43 letters. Loop has 19 letters. [2022-02-21 03:59:57,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 19 letters. [2022-02-21 03:59:57,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 43 letters. Loop has 19 letters. [2022-02-21 03:59:57,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 42 letters. Loop has 19 letters. [2022-02-21 03:59:57,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 19 letters. [2022-02-21 03:59:57,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 42 letters. Loop has 19 letters. [2022-02-21 03:59:57,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 41 letters. Loop has 15 letters. [2022-02-21 03:59:57,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 15 letters. [2022-02-21 03:59:57,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 41 letters. Loop has 15 letters. [2022-02-21 03:59:57,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 40 letters. Loop has 15 letters. [2022-02-21 03:59:57,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 15 letters. [2022-02-21 03:59:57,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 40 letters. Loop has 15 letters. [2022-02-21 03:59:57,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 39 letters. Loop has 15 letters. [2022-02-21 03:59:57,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 15 letters. [2022-02-21 03:59:57,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 39 letters. Loop has 15 letters. [2022-02-21 03:59:57,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 38 letters. Loop has 15 letters. [2022-02-21 03:59:57,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 15 letters. [2022-02-21 03:59:57,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 38 letters. Loop has 15 letters. [2022-02-21 03:59:57,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 37 letters. Loop has 11 letters. [2022-02-21 03:59:57,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 11 letters. [2022-02-21 03:59:57,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 37 letters. Loop has 11 letters. [2022-02-21 03:59:57,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 36 letters. Loop has 11 letters. [2022-02-21 03:59:57,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 11 letters. [2022-02-21 03:59:57,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 36 letters. Loop has 11 letters. [2022-02-21 03:59:57,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 35 letters. Loop has 11 letters. [2022-02-21 03:59:57,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 11 letters. [2022-02-21 03:59:57,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 35 letters. Loop has 11 letters. [2022-02-21 03:59:57,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 11 letters. [2022-02-21 03:59:57,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 11 letters. [2022-02-21 03:59:57,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 11 letters. [2022-02-21 03:59:57,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 33 letters. Loop has 11 letters. [2022-02-21 03:59:57,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 11 letters. [2022-02-21 03:59:57,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 33 letters. Loop has 11 letters. [2022-02-21 03:59:57,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 30 letters. Loop has 11 letters. [2022-02-21 03:59:57,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 11 letters. [2022-02-21 03:59:57,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 30 letters. Loop has 11 letters. [2022-02-21 03:59:57,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:57,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:57,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:57,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:57,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:57,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:57,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:57,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:57,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:57,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:57,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:57,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:57,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:57,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:57,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:57,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:57,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 35 letters. Loop has 11 letters. [2022-02-21 03:59:57,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 11 letters. [2022-02-21 03:59:57,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 35 letters. Loop has 11 letters. [2022-02-21 03:59:57,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 39 letters. Loop has 15 letters. [2022-02-21 03:59:57,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 15 letters. [2022-02-21 03:59:57,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 39 letters. Loop has 15 letters. [2022-02-21 03:59:57,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 44 letters. Loop has 19 letters. [2022-02-21 03:59:57,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 19 letters. [2022-02-21 03:59:57,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 44 letters. Loop has 19 letters. [2022-02-21 03:59:57,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 30 letters. Loop has 11 letters. [2022-02-21 03:59:57,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 11 letters. [2022-02-21 03:59:57,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 30 letters. Loop has 11 letters. [2022-02-21 03:59:57,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 40 letters. Loop has 15 letters. [2022-02-21 03:59:57,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 15 letters. [2022-02-21 03:59:57,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 40 letters. Loop has 15 letters. [2022-02-21 03:59:57,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 45 letters. Loop has 19 letters. [2022-02-21 03:59:57,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 19 letters. [2022-02-21 03:59:57,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 45 letters. Loop has 19 letters. [2022-02-21 03:59:57,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 36 letters. Loop has 11 letters. [2022-02-21 03:59:57,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 11 letters. [2022-02-21 03:59:57,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 36 letters. Loop has 11 letters. [2022-02-21 03:59:57,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 33 letters. Loop has 11 letters. [2022-02-21 03:59:57,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 11 letters. [2022-02-21 03:59:57,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 33 letters. Loop has 11 letters. [2022-02-21 03:59:57,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:57,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:57,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:57,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 41 letters. Loop has 15 letters. [2022-02-21 03:59:57,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 15 letters. [2022-02-21 03:59:57,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 41 letters. Loop has 15 letters. [2022-02-21 03:59:57,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:57,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:57,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:57,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:57,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:57,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:57,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:57,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 37 letters. Loop has 11 letters. [2022-02-21 03:59:57,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 11 letters. [2022-02-21 03:59:57,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 37 letters. Loop has 11 letters. [2022-02-21 03:59:57,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 42 letters. Loop has 19 letters. [2022-02-21 03:59:57,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 19 letters. [2022-02-21 03:59:57,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 42 letters. Loop has 19 letters. [2022-02-21 03:59:57,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:57,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:57,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:57,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 11 letters. [2022-02-21 03:59:57,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 11 letters. [2022-02-21 03:59:57,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 11 letters. [2022-02-21 03:59:57,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 50 letters. Loop has 23 letters. [2022-02-21 03:59:57,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 23 letters. [2022-02-21 03:59:57,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 50 letters. Loop has 23 letters. [2022-02-21 03:59:57,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 51 letters. Loop has 23 letters. [2022-02-21 03:59:57,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 23 letters. [2022-02-21 03:59:57,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 51 letters. Loop has 23 letters. [2022-02-21 03:59:57,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:57,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:57,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:57,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 43 letters. Loop has 19 letters. [2022-02-21 03:59:57,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 19 letters. [2022-02-21 03:59:57,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 43 letters. Loop has 19 letters. [2022-02-21 03:59:57,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 38 letters. Loop has 15 letters. [2022-02-21 03:59:57,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 15 letters. [2022-02-21 03:59:57,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 499 states and 605 transitions. cyclomatic complexity: 118 Stem has 38 letters. Loop has 15 letters. [2022-02-21 03:59:57,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,822 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:57,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-02-21 03:59:57,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,823 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:59:57,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:57,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:59:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:57,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:57,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {13011#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(9, 2);~__BLAST_NONDET~0 := 0; {13011#unseeded} is VALID [2022-02-21 03:59:57,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {13011#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {13011#unseeded} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {13011#unseeded} is VALID [2022-02-21 03:59:57,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {13011#unseeded} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {13011#unseeded} is VALID [2022-02-21 03:59:57,906 INFO L290 TraceCheckUtils]: 4: Hoare triple {13011#unseeded} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {13011#unseeded} is VALID [2022-02-21 03:59:57,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {13011#unseeded} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {13011#unseeded} main_~i~0#1 := 0; {13011#unseeded} is VALID [2022-02-21 03:59:57,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {13011#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {13011#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {13011#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {13011#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {13011#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {13011#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {13011#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {13011#unseeded} assume { :end_inline___VERIFIER_assert } true; {13011#unseeded} is VALID [2022-02-21 03:59:57,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {13011#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {13011#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {13011#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {13011#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {13011#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {13011#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {13011#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {13011#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {13011#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {13011#unseeded} assume { :end_inline___VERIFIER_assert } true; {13011#unseeded} is VALID [2022-02-21 03:59:57,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {13011#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {13011#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {13011#unseeded} is VALID [2022-02-21 03:59:57,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {13011#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {13011#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {13011#unseeded} is VALID [2022-02-21 03:59:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:57,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:59:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:57,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:57,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,980 INFO L290 TraceCheckUtils]: 4: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} assume !(main_~k~0#1 < main_~j~0#1); {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:59:57,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {13014#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {14396#(<= (+ (* 3 |ULTIMATE.start_main_~i~0#1|) 1) (+ |ULTIMATE.start_main_~j~0#1| oldRank0))} is VALID [2022-02-21 03:59:57,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {14396#(<= (+ (* 3 |ULTIMATE.start_main_~i~0#1|) 1) (+ |ULTIMATE.start_main_~j~0#1| oldRank0))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {13024#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (* 3 |ULTIMATE.start_main_~i~0#1|)))))} is VALID [2022-02-21 03:59:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-21 03:59:57,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:57,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:57,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:57,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:57,992 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:59:57,992 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 485 states and 591 transitions. cyclomatic complexity: 118 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:58,062 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 485 states and 591 transitions. cyclomatic complexity: 118. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 888 states and 1043 transitions. Complement of second has 6 states. [2022-02-21 03:59:58,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:59:58,063 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:58,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 485 states and 591 transitions. cyclomatic complexity: 118 [2022-02-21 03:59:58,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:58,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:58,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:58,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:59:58,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:58,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:58,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 888 states and 1043 transitions. [2022-02-21 03:59:58,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2022-02-21 03:59:58,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:58,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:58,067 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 485 states and 591 transitions. cyclomatic complexity: 118 [2022-02-21 03:59:58,067 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 28 examples of accepted words. [2022-02-21 03:59:58,067 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:58,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:59:58,068 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:59:58,068 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 888 states and 1043 transitions. cyclomatic complexity: 173 [2022-02-21 03:59:58,085 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 25 examples of accepted words. [2022-02-21 03:59:58,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:58,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:58,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:58,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:58,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:58,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:58,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 26 letters. [2022-02-21 03:59:58,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 26 letters. [2022-02-21 03:59:58,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 29 letters. Loop has 26 letters. [2022-02-21 03:59:58,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 888 letters. Loop has 888 letters. [2022-02-21 03:59:58,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 888 letters. Loop has 888 letters. [2022-02-21 03:59:58,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 888 letters. Loop has 888 letters. [2022-02-21 03:59:58,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 485 letters. Loop has 485 letters. [2022-02-21 03:59:58,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 485 letters. Loop has 485 letters. [2022-02-21 03:59:58,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 485 letters. Loop has 485 letters. [2022-02-21 03:59:58,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:59:58,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:59:58,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:59:58,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:58,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:58,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:58,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:58,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:58,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:58,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:58,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:58,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 32 letters. Loop has 11 letters. [2022-02-21 03:59:58,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:58,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:58,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:58,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 51 letters. Loop has 23 letters. [2022-02-21 03:59:58,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 23 letters. [2022-02-21 03:59:58,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 51 letters. Loop has 23 letters. [2022-02-21 03:59:58,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 50 letters. Loop has 23 letters. [2022-02-21 03:59:58,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 23 letters. [2022-02-21 03:59:58,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 50 letters. Loop has 23 letters. [2022-02-21 03:59:58,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:58,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:58,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:58,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:58,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:58,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:58,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:58,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:58,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:58,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:58,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:58,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:58,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 45 letters. Loop has 19 letters. [2022-02-21 03:59:58,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 19 letters. [2022-02-21 03:59:58,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 45 letters. Loop has 19 letters. [2022-02-21 03:59:58,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 44 letters. Loop has 19 letters. [2022-02-21 03:59:58,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 19 letters. [2022-02-21 03:59:58,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 44 letters. Loop has 19 letters. [2022-02-21 03:59:58,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 43 letters. Loop has 19 letters. [2022-02-21 03:59:58,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 19 letters. [2022-02-21 03:59:58,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 43 letters. Loop has 19 letters. [2022-02-21 03:59:58,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 42 letters. Loop has 19 letters. [2022-02-21 03:59:58,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 19 letters. [2022-02-21 03:59:58,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 42 letters. Loop has 19 letters. [2022-02-21 03:59:58,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 41 letters. Loop has 15 letters. [2022-02-21 03:59:58,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 15 letters. [2022-02-21 03:59:58,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 41 letters. Loop has 15 letters. [2022-02-21 03:59:58,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 40 letters. Loop has 15 letters. [2022-02-21 03:59:58,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 15 letters. [2022-02-21 03:59:58,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 40 letters. Loop has 15 letters. [2022-02-21 03:59:58,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 39 letters. Loop has 15 letters. [2022-02-21 03:59:58,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 15 letters. [2022-02-21 03:59:58,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 39 letters. Loop has 15 letters. [2022-02-21 03:59:58,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 38 letters. Loop has 15 letters. [2022-02-21 03:59:58,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 15 letters. [2022-02-21 03:59:58,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 38 letters. Loop has 15 letters. [2022-02-21 03:59:58,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 37 letters. Loop has 11 letters. [2022-02-21 03:59:58,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 11 letters. [2022-02-21 03:59:58,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 37 letters. Loop has 11 letters. [2022-02-21 03:59:58,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 36 letters. Loop has 11 letters. [2022-02-21 03:59:58,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 11 letters. [2022-02-21 03:59:58,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 36 letters. Loop has 11 letters. [2022-02-21 03:59:58,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 35 letters. Loop has 11 letters. [2022-02-21 03:59:58,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 11 letters. [2022-02-21 03:59:58,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 35 letters. Loop has 11 letters. [2022-02-21 03:59:58,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 11 letters. [2022-02-21 03:59:58,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 11 letters. [2022-02-21 03:59:58,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 34 letters. Loop has 11 letters. [2022-02-21 03:59:58,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 33 letters. Loop has 11 letters. [2022-02-21 03:59:58,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 11 letters. [2022-02-21 03:59:58,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 33 letters. Loop has 11 letters. [2022-02-21 03:59:58,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:58,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:58,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:58,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 30 letters. Loop has 11 letters. [2022-02-21 03:59:58,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 11 letters. [2022-02-21 03:59:58,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 30 letters. Loop has 11 letters. [2022-02-21 03:59:58,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:58,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:58,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:58,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:58,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:58,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:58,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:58,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:58,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 31 letters. Loop has 11 letters. [2022-02-21 03:59:58,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:58,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:58,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:59:58,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 33 letters. Loop has 26 letters. [2022-02-21 03:59:58,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 26 letters. [2022-02-21 03:59:58,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 33 letters. Loop has 26 letters. [2022-02-21 03:59:58,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:58,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:58,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:59:58,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 35 letters. Loop has 26 letters. [2022-02-21 03:59:58,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 26 letters. [2022-02-21 03:59:58,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 35 letters. Loop has 26 letters. [2022-02-21 03:59:58,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 39 letters. Loop has 26 letters. [2022-02-21 03:59:58,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 26 letters. [2022-02-21 03:59:58,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 39 letters. Loop has 26 letters. [2022-02-21 03:59:58,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:58,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:58,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:59:58,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 32 letters. Loop has 26 letters. [2022-02-21 03:59:58,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 26 letters. [2022-02-21 03:59:58,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 32 letters. Loop has 26 letters. [2022-02-21 03:59:58,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 44 letters. Loop has 26 letters. [2022-02-21 03:59:58,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 26 letters. [2022-02-21 03:59:58,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 44 letters. Loop has 26 letters. [2022-02-21 03:59:58,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 37 letters. Loop has 26 letters. [2022-02-21 03:59:58,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 26 letters. [2022-02-21 03:59:58,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 37 letters. Loop has 26 letters. [2022-02-21 03:59:58,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 42 letters. Loop has 26 letters. [2022-02-21 03:59:58,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 26 letters. [2022-02-21 03:59:58,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 42 letters. Loop has 26 letters. [2022-02-21 03:59:58,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 31 letters. Loop has 26 letters. [2022-02-21 03:59:58,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 26 letters. [2022-02-21 03:59:58,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 31 letters. Loop has 26 letters. [2022-02-21 03:59:58,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:58,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:58,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:59:58,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:58,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:58,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:58,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 40 letters. Loop has 26 letters. [2022-02-21 03:59:58,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 26 letters. [2022-02-21 03:59:58,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 40 letters. Loop has 26 letters. [2022-02-21 03:59:58,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 50 letters. Loop has 26 letters. [2022-02-21 03:59:58,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 26 letters. [2022-02-21 03:59:58,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 50 letters. Loop has 26 letters. [2022-02-21 03:59:58,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 45 letters. Loop has 26 letters. [2022-02-21 03:59:58,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 26 letters. [2022-02-21 03:59:58,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 45 letters. Loop has 26 letters. [2022-02-21 03:59:58,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 51 letters. Loop has 26 letters. [2022-02-21 03:59:58,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 26 letters. [2022-02-21 03:59:58,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 51 letters. Loop has 26 letters. [2022-02-21 03:59:58,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 36 letters. Loop has 26 letters. [2022-02-21 03:59:58,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 26 letters. [2022-02-21 03:59:58,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 36 letters. Loop has 26 letters. [2022-02-21 03:59:58,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 43 letters. Loop has 26 letters. [2022-02-21 03:59:58,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 26 letters. [2022-02-21 03:59:58,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 43 letters. Loop has 26 letters. [2022-02-21 03:59:58,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 38 letters. Loop has 26 letters. [2022-02-21 03:59:58,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 26 letters. [2022-02-21 03:59:58,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 38 letters. Loop has 26 letters. [2022-02-21 03:59:58,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:58,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:58,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 52 letters. Loop has 26 letters. [2022-02-21 03:59:58,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:58,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:58,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:59:58,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:58,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:58,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 34 letters. Loop has 26 letters. [2022-02-21 03:59:58,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 41 letters. Loop has 26 letters. [2022-02-21 03:59:58,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 26 letters. [2022-02-21 03:59:58,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 41 letters. Loop has 26 letters. [2022-02-21 03:59:58,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:58,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:58,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 53 letters. Loop has 26 letters. [2022-02-21 03:59:58,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 485 states and 591 transitions. cyclomatic complexity: 118 Stem has 29 letters. Loop has 26 letters. [2022-02-21 03:59:58,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 26 letters. [2022-02-21 03:59:58,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 888 states and 1043 transitions. cyclomatic complexity: 173 Stem has 29 letters. Loop has 26 letters. [2022-02-21 03:59:58,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,195 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:58,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:59:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-02-21 03:59:58,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 29 letters. Loop has 11 letters. [2022-02-21 03:59:58,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 40 letters. Loop has 11 letters. [2022-02-21 03:59:58,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 29 letters. Loop has 22 letters. [2022-02-21 03:59:58,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:58,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 888 states and 1043 transitions. cyclomatic complexity: 173 [2022-02-21 03:59:58,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2022-02-21 03:59:58,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 888 states to 656 states and 775 transitions. [2022-02-21 03:59:58,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2022-02-21 03:59:58,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-02-21 03:59:58,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 656 states and 775 transitions. [2022-02-21 03:59:58,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:59:58,288 INFO L681 BuchiCegarLoop]: Abstraction has 656 states and 775 transitions. [2022-02-21 03:59:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states and 775 transitions. [2022-02-21 03:59:58,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 557. [2022-02-21 03:59:58,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:59:58,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 656 states and 775 transitions. Second operand has 557 states, 557 states have (on average 1.1759425493716338) internal successors, (655), 556 states have internal predecessors, (655), 0 states have call successors, (0), 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:59:58,295 INFO L74 IsIncluded]: Start isIncluded. First operand 656 states and 775 transitions. Second operand has 557 states, 557 states have (on average 1.1759425493716338) internal successors, (655), 556 states have internal predecessors, (655), 0 states have call successors, (0), 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:59:58,295 INFO L87 Difference]: Start difference. First operand 656 states and 775 transitions. Second operand has 557 states, 557 states have (on average 1.1759425493716338) internal successors, (655), 556 states have internal predecessors, (655), 0 states have call successors, (0), 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:59:58,295 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:58,328 INFO L93 Difference]: Finished difference Result 833 states and 998 transitions. [2022-02-21 03:59:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 998 transitions. [2022-02-21 03:59:58,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:58,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:58,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 557 states, 557 states have (on average 1.1759425493716338) internal successors, (655), 556 states have internal predecessors, (655), 0 states have call successors, (0), 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 656 states and 775 transitions. [2022-02-21 03:59:58,346 INFO L87 Difference]: Start difference. First operand has 557 states, 557 states have (on average 1.1759425493716338) internal successors, (655), 556 states have internal predecessors, (655), 0 states have call successors, (0), 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 656 states and 775 transitions. [2022-02-21 03:59:58,346 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:58,379 INFO L93 Difference]: Finished difference Result 833 states and 998 transitions. [2022-02-21 03:59:58,380 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 998 transitions. [2022-02-21 03:59:58,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:58,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:58,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:59:58,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:59:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 557 states have (on average 1.1759425493716338) internal successors, (655), 556 states have internal predecessors, (655), 0 states have call successors, (0), 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:59:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 655 transitions. [2022-02-21 03:59:58,397 INFO L704 BuchiCegarLoop]: Abstraction has 557 states and 655 transitions. [2022-02-21 03:59:58,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:59:58,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:59:58,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:59:58,398 INFO L87 Difference]: Start difference. First operand 557 states and 655 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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:59:58,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:59:58,662 INFO L93 Difference]: Finished difference Result 581 states and 658 transitions. [2022-02-21 03:59:58,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:59:58,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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:59:58,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:58,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 581 states and 658 transitions. [2022-02-21 03:59:58,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2022-02-21 03:59:58,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 581 states to 260 states and 290 transitions. [2022-02-21 03:59:58,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-02-21 03:59:58,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-02-21 03:59:58,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 260 states and 290 transitions. [2022-02-21 03:59:58,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:59:58,712 INFO L681 BuchiCegarLoop]: Abstraction has 260 states and 290 transitions. [2022-02-21 03:59:58,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states and 290 transitions. [2022-02-21 03:59:58,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 244. [2022-02-21 03:59:58,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:59:58,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states and 290 transitions. Second operand has 244 states, 244 states have (on average 1.1229508196721312) internal successors, (274), 243 states have internal predecessors, (274), 0 states have call successors, (0), 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:59:58,715 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states and 290 transitions. Second operand has 244 states, 244 states have (on average 1.1229508196721312) internal successors, (274), 243 states have internal predecessors, (274), 0 states have call successors, (0), 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:59:58,715 INFO L87 Difference]: Start difference. First operand 260 states and 290 transitions. Second operand has 244 states, 244 states have (on average 1.1229508196721312) internal successors, (274), 243 states have internal predecessors, (274), 0 states have call successors, (0), 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:59:58,715 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:58,719 INFO L93 Difference]: Finished difference Result 320 states and 369 transitions. [2022-02-21 03:59:58,719 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 369 transitions. [2022-02-21 03:59:58,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:58,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:58,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 244 states have (on average 1.1229508196721312) internal successors, (274), 243 states have internal predecessors, (274), 0 states have call successors, (0), 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 260 states and 290 transitions. [2022-02-21 03:59:58,721 INFO L87 Difference]: Start difference. First operand has 244 states, 244 states have (on average 1.1229508196721312) internal successors, (274), 243 states have internal predecessors, (274), 0 states have call successors, (0), 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 260 states and 290 transitions. [2022-02-21 03:59:58,721 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:59:58,725 INFO L93 Difference]: Finished difference Result 323 states and 374 transitions. [2022-02-21 03:59:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 374 transitions. [2022-02-21 03:59:58,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:58,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:58,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:59:58,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:59:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 244 states have (on average 1.1229508196721312) internal successors, (274), 243 states have internal predecessors, (274), 0 states have call successors, (0), 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:59:58,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 274 transitions. [2022-02-21 03:59:58,729 INFO L704 BuchiCegarLoop]: Abstraction has 244 states and 274 transitions. [2022-02-21 03:59:58,730 INFO L587 BuchiCegarLoop]: Abstraction has 244 states and 274 transitions. [2022-02-21 03:59:58,730 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 03:59:58,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 244 states and 274 transitions. [2022-02-21 03:59:58,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2022-02-21 03:59:58,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:58,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:58,731 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:58,731 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:58,731 INFO L791 eck$LassoCheckResult]: Stem: 18303#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(9, 2);~__BLAST_NONDET~0 := 0; 18304#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 18305#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 18306#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 18310#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 18309#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 18307#L33-1 main_~i~0#1 := 0; 18308#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 18337#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 18317#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 18318#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 18398#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 18479#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 18476#L18 assume !(0 == __VERIFIER_assert_~cond#1); 18472#L18-2 assume { :end_inline___VERIFIER_assert } true; 18469#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 18466#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 18462#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 18463#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 18497#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 18366#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 18358#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 18311#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 18312#L18 assume !(0 == __VERIFIER_assert_~cond#1); 18520#L18-2 assume { :end_inline___VERIFIER_assert } true; 18518#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 18517#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 18516#L18 assume !(0 == __VERIFIER_assert_~cond#1); 18515#L18-2 assume { :end_inline___VERIFIER_assert } true; 18514#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 18360#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 18359#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 18357#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 18355#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 18326#L18 [2022-02-21 03:59:58,731 INFO L793 eck$LassoCheckResult]: Loop: 18326#L18 assume !(0 == __VERIFIER_assert_~cond#1); 18327#L18-2 assume { :end_inline___VERIFIER_assert } true; 18322#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 18323#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 18352#L18 assume !(0 == __VERIFIER_assert_~cond#1); 18329#L18-2 assume { :end_inline___VERIFIER_assert } true; 18330#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 18351#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 18350#L18 assume !(0 == __VERIFIER_assert_~cond#1); 18349#L18-2 assume { :end_inline___VERIFIER_assert } true; 18348#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 18347#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 18346#L18 assume !(0 == __VERIFIER_assert_~cond#1); 18345#L18-2 assume { :end_inline___VERIFIER_assert } true; 18344#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 18343#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 18340#L18 assume !(0 == __VERIFIER_assert_~cond#1); 18342#L18-2 assume { :end_inline___VERIFIER_assert } true; 18341#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 18339#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 18333#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 18334#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 18315#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 18316#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 18356#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 18353#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 18326#L18 [2022-02-21 03:59:58,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:58,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1304386790, now seen corresponding path program 5 times [2022-02-21 03:59:58,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:58,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96939098] [2022-02-21 03:59:58,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:58,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:58,755 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:58,777 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:58,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:58,780 INFO L85 PathProgramCache]: Analyzing trace with hash 96299068, now seen corresponding path program 4 times [2022-02-21 03:59:58,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:58,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206084623] [2022-02-21 03:59:58,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:58,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:58,797 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:58,810 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:58,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:58,815 INFO L85 PathProgramCache]: Analyzing trace with hash -96091935, now seen corresponding path program 6 times [2022-02-21 03:59:58,815 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:58,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844325178] [2022-02-21 03:59:58,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:58,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:58,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {19364#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(9, 2);~__BLAST_NONDET~0 := 0; {19364#true} is VALID [2022-02-21 03:59:58,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {19364#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {19364#true} is VALID [2022-02-21 03:59:58,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {19364#true} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {19364#true} is VALID [2022-02-21 03:59:58,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {19364#true} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {19364#true} is VALID [2022-02-21 03:59:58,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {19364#true} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {19364#true} is VALID [2022-02-21 03:59:58,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {19364#true} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {19364#true} is VALID [2022-02-21 03:59:58,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {19364#true} main_~i~0#1 := 0; {19366#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:58,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {19366#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {19366#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:58,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {19366#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < 3 * main_~i~0#1); {19366#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:58,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {19366#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:58,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:58,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:58,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:58,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == __VERIFIER_assert_~cond#1); {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:58,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume { :end_inline___VERIFIER_assert } true; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:58,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:58,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~k~0#1 < main_~j~0#1); {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:58,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:58,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~j~0#1 < 3 * main_~i~0#1); {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:58,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:59:58,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:58,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:58,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:58,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:58,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume { :end_inline___VERIFIER_assert } true; {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:58,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:58,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:58,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:58,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume { :end_inline___VERIFIER_assert } true; {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:58,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:58,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(main_~k~0#1 < main_~j~0#1); {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:58,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {19369#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {19370#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:59:58,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {19370#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {19371#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:58,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {19371#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19371#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:58,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {19371#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~k~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {19371#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:58,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {19371#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~k~0#1|))} assume { :end_inline___VERIFIER_assert } true; {19371#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:58,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {19371#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~k~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19372#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:58,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {19372#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19372#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:58,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {19372#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {19372#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:58,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {19372#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} assume { :end_inline___VERIFIER_assert } true; {19372#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:58,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {19372#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19373#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 03:59:58,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {19373#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19373#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 03:59:58,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {19373#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} assume !(0 == __VERIFIER_assert_~cond#1); {19373#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 03:59:58,952 INFO L290 TraceCheckUtils]: 43: Hoare triple {19373#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} assume { :end_inline___VERIFIER_assert } true; {19373#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 03:59:58,953 INFO L290 TraceCheckUtils]: 44: Hoare triple {19373#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19374#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-21 03:59:58,953 INFO L290 TraceCheckUtils]: 45: Hoare triple {19374#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19374#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-21 03:59:58,953 INFO L290 TraceCheckUtils]: 46: Hoare triple {19374#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)} assume !(0 == __VERIFIER_assert_~cond#1); {19374#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-21 03:59:58,954 INFO L290 TraceCheckUtils]: 47: Hoare triple {19374#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)} assume { :end_inline___VERIFIER_assert } true; {19374#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-21 03:59:58,954 INFO L290 TraceCheckUtils]: 48: Hoare triple {19374#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19375#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-21 03:59:58,954 INFO L290 TraceCheckUtils]: 49: Hoare triple {19375#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~k~0#1|)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19365#false} is VALID [2022-02-21 03:59:58,955 INFO L290 TraceCheckUtils]: 50: Hoare triple {19365#false} assume !(0 == __VERIFIER_assert_~cond#1); {19365#false} is VALID [2022-02-21 03:59:58,955 INFO L290 TraceCheckUtils]: 51: Hoare triple {19365#false} assume { :end_inline___VERIFIER_assert } true; {19365#false} is VALID [2022-02-21 03:59:58,955 INFO L290 TraceCheckUtils]: 52: Hoare triple {19365#false} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19365#false} is VALID [2022-02-21 03:59:58,955 INFO L290 TraceCheckUtils]: 53: Hoare triple {19365#false} assume !(main_~k~0#1 < main_~j~0#1); {19365#false} is VALID [2022-02-21 03:59:58,955 INFO L290 TraceCheckUtils]: 54: Hoare triple {19365#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {19365#false} is VALID [2022-02-21 03:59:58,955 INFO L290 TraceCheckUtils]: 55: Hoare triple {19365#false} assume !(main_~j~0#1 < 3 * main_~i~0#1); {19365#false} is VALID [2022-02-21 03:59:58,955 INFO L290 TraceCheckUtils]: 56: Hoare triple {19365#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {19365#false} is VALID [2022-02-21 03:59:58,955 INFO L290 TraceCheckUtils]: 57: Hoare triple {19365#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {19365#false} is VALID [2022-02-21 03:59:58,955 INFO L290 TraceCheckUtils]: 58: Hoare triple {19365#false} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {19365#false} is VALID [2022-02-21 03:59:58,956 INFO L290 TraceCheckUtils]: 59: Hoare triple {19365#false} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19365#false} is VALID [2022-02-21 03:59:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 86 proven. 87 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-21 03:59:58,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:59:58,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844325178] [2022-02-21 03:59:58,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844325178] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:59:58,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177559124] [2022-02-21 03:59:58,958 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-21 03:59:58,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:59:58,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:58,959 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:59:58,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-02-21 03:59:59,005 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-02-21 03:59:59,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:59:59,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:59:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:59,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:59,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {19364#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(9, 2);~__BLAST_NONDET~0 := 0; {19364#true} is VALID [2022-02-21 03:59:59,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {19364#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {19364#true} is VALID [2022-02-21 03:59:59,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {19364#true} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {19364#true} is VALID [2022-02-21 03:59:59,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {19364#true} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {19364#true} is VALID [2022-02-21 03:59:59,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {19364#true} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {19364#true} is VALID [2022-02-21 03:59:59,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {19364#true} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {19364#true} is VALID [2022-02-21 03:59:59,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {19364#true} main_~i~0#1 := 0; {19397#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:59,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {19397#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {19397#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:59,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {19397#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < 3 * main_~i~0#1); {19397#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:59,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {19397#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:59,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:59,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:59,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:59,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == __VERIFIER_assert_~cond#1); {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:59,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume { :end_inline___VERIFIER_assert } true; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:59,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:59,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~k~0#1 < main_~j~0#1); {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:59,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:59,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~j~0#1 < 3 * main_~i~0#1); {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:59:59,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:59:59,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:59:59,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:59:59,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:59:59,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(0 == __VERIFIER_assert_~cond#1); {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:59:59,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume { :end_inline___VERIFIER_assert } true; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:59:59,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:59:59,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:59:59,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(0 == __VERIFIER_assert_~cond#1); {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:59:59,728 INFO L290 TraceCheckUtils]: 28: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume { :end_inline___VERIFIER_assert } true; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:59:59,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:59:59,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~k~0#1 < main_~j~0#1); {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:59:59,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:59:59,730 INFO L290 TraceCheckUtils]: 32: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {19476#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) (+ |ULTIMATE.start_main_~k~0#1| 1)))} is VALID [2022-02-21 03:59:59,731 INFO L290 TraceCheckUtils]: 33: Hoare triple {19476#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) (+ |ULTIMATE.start_main_~k~0#1| 1)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19476#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) (+ |ULTIMATE.start_main_~k~0#1| 1)))} is VALID [2022-02-21 03:59:59,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {19476#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) (+ |ULTIMATE.start_main_~k~0#1| 1)))} assume !(0 == __VERIFIER_assert_~cond#1); {19476#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) (+ |ULTIMATE.start_main_~k~0#1| 1)))} is VALID [2022-02-21 03:59:59,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {19476#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) (+ |ULTIMATE.start_main_~k~0#1| 1)))} assume { :end_inline___VERIFIER_assert } true; {19476#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) (+ |ULTIMATE.start_main_~k~0#1| 1)))} is VALID [2022-02-21 03:59:59,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {19476#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) (+ |ULTIMATE.start_main_~k~0#1| 1)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19489#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) |ULTIMATE.start_main_~k~0#1|) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3))} is VALID [2022-02-21 03:59:59,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {19489#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) |ULTIMATE.start_main_~k~0#1|) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19489#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) |ULTIMATE.start_main_~k~0#1|) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3))} is VALID [2022-02-21 03:59:59,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {19489#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) |ULTIMATE.start_main_~k~0#1|) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3))} assume !(0 == __VERIFIER_assert_~cond#1); {19489#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) |ULTIMATE.start_main_~k~0#1|) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3))} is VALID [2022-02-21 03:59:59,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {19489#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) |ULTIMATE.start_main_~k~0#1|) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3))} assume { :end_inline___VERIFIER_assert } true; {19489#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) |ULTIMATE.start_main_~k~0#1|) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3))} is VALID [2022-02-21 03:59:59,735 INFO L290 TraceCheckUtils]: 40: Hoare triple {19489#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) |ULTIMATE.start_main_~k~0#1|) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19502#(and (< (+ (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 1) |ULTIMATE.start_main_~k~0#1|) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3))} is VALID [2022-02-21 03:59:59,736 INFO L290 TraceCheckUtils]: 41: Hoare triple {19502#(and (< (+ (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 1) |ULTIMATE.start_main_~k~0#1|) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19502#(and (< (+ (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 1) |ULTIMATE.start_main_~k~0#1|) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3))} is VALID [2022-02-21 03:59:59,736 INFO L290 TraceCheckUtils]: 42: Hoare triple {19502#(and (< (+ (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 1) |ULTIMATE.start_main_~k~0#1|) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3))} assume !(0 == __VERIFIER_assert_~cond#1); {19502#(and (< (+ (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 1) |ULTIMATE.start_main_~k~0#1|) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3))} is VALID [2022-02-21 03:59:59,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {19502#(and (< (+ (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 1) |ULTIMATE.start_main_~k~0#1|) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3))} assume { :end_inline___VERIFIER_assert } true; {19502#(and (< (+ (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 1) |ULTIMATE.start_main_~k~0#1|) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3))} is VALID [2022-02-21 03:59:59,737 INFO L290 TraceCheckUtils]: 44: Hoare triple {19502#(and (< (+ (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 1) |ULTIMATE.start_main_~k~0#1|) (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19515#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3) (< (+ 2 (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3))) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 03:59:59,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {19515#(and (< (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3)) 3) (< (+ 2 (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) (- 1)) (- 3))) |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19365#false} is VALID [2022-02-21 03:59:59,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {19365#false} assume !(0 == __VERIFIER_assert_~cond#1); {19365#false} is VALID [2022-02-21 03:59:59,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {19365#false} assume { :end_inline___VERIFIER_assert } true; {19365#false} is VALID [2022-02-21 03:59:59,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {19365#false} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19365#false} is VALID [2022-02-21 03:59:59,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {19365#false} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19365#false} is VALID [2022-02-21 03:59:59,739 INFO L290 TraceCheckUtils]: 50: Hoare triple {19365#false} assume !(0 == __VERIFIER_assert_~cond#1); {19365#false} is VALID [2022-02-21 03:59:59,739 INFO L290 TraceCheckUtils]: 51: Hoare triple {19365#false} assume { :end_inline___VERIFIER_assert } true; {19365#false} is VALID [2022-02-21 03:59:59,739 INFO L290 TraceCheckUtils]: 52: Hoare triple {19365#false} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19365#false} is VALID [2022-02-21 03:59:59,739 INFO L290 TraceCheckUtils]: 53: Hoare triple {19365#false} assume !(main_~k~0#1 < main_~j~0#1); {19365#false} is VALID [2022-02-21 03:59:59,739 INFO L290 TraceCheckUtils]: 54: Hoare triple {19365#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {19365#false} is VALID [2022-02-21 03:59:59,740 INFO L290 TraceCheckUtils]: 55: Hoare triple {19365#false} assume !(main_~j~0#1 < 3 * main_~i~0#1); {19365#false} is VALID [2022-02-21 03:59:59,740 INFO L290 TraceCheckUtils]: 56: Hoare triple {19365#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {19365#false} is VALID [2022-02-21 03:59:59,740 INFO L290 TraceCheckUtils]: 57: Hoare triple {19365#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {19365#false} is VALID [2022-02-21 03:59:59,740 INFO L290 TraceCheckUtils]: 58: Hoare triple {19365#false} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {19365#false} is VALID [2022-02-21 03:59:59,740 INFO L290 TraceCheckUtils]: 59: Hoare triple {19365#false} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19365#false} is VALID [2022-02-21 03:59:59,741 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 95 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-21 03:59:59,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:00:00,034 INFO L290 TraceCheckUtils]: 59: Hoare triple {19365#false} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19365#false} is VALID [2022-02-21 04:00:00,035 INFO L290 TraceCheckUtils]: 58: Hoare triple {19365#false} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {19365#false} is VALID [2022-02-21 04:00:00,035 INFO L290 TraceCheckUtils]: 57: Hoare triple {19365#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {19365#false} is VALID [2022-02-21 04:00:00,035 INFO L290 TraceCheckUtils]: 56: Hoare triple {19365#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {19365#false} is VALID [2022-02-21 04:00:00,035 INFO L290 TraceCheckUtils]: 55: Hoare triple {19365#false} assume !(main_~j~0#1 < 3 * main_~i~0#1); {19365#false} is VALID [2022-02-21 04:00:00,035 INFO L290 TraceCheckUtils]: 54: Hoare triple {19365#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {19365#false} is VALID [2022-02-21 04:00:00,035 INFO L290 TraceCheckUtils]: 53: Hoare triple {19365#false} assume !(main_~k~0#1 < main_~j~0#1); {19365#false} is VALID [2022-02-21 04:00:00,035 INFO L290 TraceCheckUtils]: 52: Hoare triple {19365#false} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19365#false} is VALID [2022-02-21 04:00:00,036 INFO L290 TraceCheckUtils]: 51: Hoare triple {19365#false} assume { :end_inline___VERIFIER_assert } true; {19365#false} is VALID [2022-02-21 04:00:00,036 INFO L290 TraceCheckUtils]: 50: Hoare triple {19365#false} assume !(0 == __VERIFIER_assert_~cond#1); {19365#false} is VALID [2022-02-21 04:00:00,036 INFO L290 TraceCheckUtils]: 49: Hoare triple {19365#false} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19365#false} is VALID [2022-02-21 04:00:00,036 INFO L290 TraceCheckUtils]: 48: Hoare triple {19365#false} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19365#false} is VALID [2022-02-21 04:00:00,036 INFO L290 TraceCheckUtils]: 47: Hoare triple {19365#false} assume { :end_inline___VERIFIER_assert } true; {19365#false} is VALID [2022-02-21 04:00:00,036 INFO L290 TraceCheckUtils]: 46: Hoare triple {19365#false} assume !(0 == __VERIFIER_assert_~cond#1); {19365#false} is VALID [2022-02-21 04:00:00,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {19374#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19365#false} is VALID [2022-02-21 04:00:00,038 INFO L290 TraceCheckUtils]: 44: Hoare triple {19373#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19374#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-21 04:00:00,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {19373#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} assume { :end_inline___VERIFIER_assert } true; {19373#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 04:00:00,039 INFO L290 TraceCheckUtils]: 42: Hoare triple {19373#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} assume !(0 == __VERIFIER_assert_~cond#1); {19373#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 04:00:00,039 INFO L290 TraceCheckUtils]: 41: Hoare triple {19373#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19373#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 04:00:00,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {19372#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19373#(<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 04:00:00,040 INFO L290 TraceCheckUtils]: 39: Hoare triple {19372#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} assume { :end_inline___VERIFIER_assert } true; {19372#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 04:00:00,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {19372#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {19372#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 04:00:00,041 INFO L290 TraceCheckUtils]: 37: Hoare triple {19372#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19372#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 04:00:00,041 INFO L290 TraceCheckUtils]: 36: Hoare triple {19371#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~k~0#1|))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19372#(<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 04:00:00,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {19371#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~k~0#1|))} assume { :end_inline___VERIFIER_assert } true; {19371#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 04:00:00,042 INFO L290 TraceCheckUtils]: 34: Hoare triple {19371#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~k~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {19371#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 04:00:00,042 INFO L290 TraceCheckUtils]: 33: Hoare triple {19371#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19371#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 04:00:00,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {19371#(<= |ULTIMATE.start_main_~j~0#1| (+ 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-21 04:00:00,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 04:00:00,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~k~0#1 < main_~j~0#1); {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 04:00:00,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 04:00:00,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume { :end_inline___VERIFIER_assert } true; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 04:00:00,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(0 == __VERIFIER_assert_~cond#1); {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 04:00:00,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 04:00:00,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 04:00:00,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume { :end_inline___VERIFIER_assert } true; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 04:00:00,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(0 == __VERIFIER_assert_~cond#1); {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 04:00:00,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 04:00:00,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 04:00:00,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 04:00:00,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {19368#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 04:00:00,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~j~0#1 < 3 * main_~i~0#1); {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 04:00:00,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 04:00:00,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~k~0#1 < main_~j~0#1); {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 04:00:00,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 04:00:00,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume { :end_inline___VERIFIER_assert } true; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 04:00:00,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == __VERIFIER_assert_~cond#1); {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 04:00:00,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 04:00:00,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 04:00:00,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 04:00:00,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {19397#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {19367#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 04:00:00,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {19397#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < 3 * main_~i~0#1); {19397#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 04:00:00,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {19397#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {19397#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 04:00:00,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {19364#true} main_~i~0#1 := 0; {19397#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 04:00:00,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {19364#true} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {19364#true} is VALID [2022-02-21 04:00:00,053 INFO L290 TraceCheckUtils]: 4: Hoare triple {19364#true} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {19364#true} is VALID [2022-02-21 04:00:00,053 INFO L290 TraceCheckUtils]: 3: Hoare triple {19364#true} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {19364#true} is VALID [2022-02-21 04:00:00,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {19364#true} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {19364#true} is VALID [2022-02-21 04:00:00,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {19364#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {19364#true} is VALID [2022-02-21 04:00:00,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {19364#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(9, 2);~__BLAST_NONDET~0 := 0; {19364#true} is VALID [2022-02-21 04:00:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 95 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-21 04:00:00,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177559124] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:00:00,054 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:00:00,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 17 [2022-02-21 04:00:00,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834774550] [2022-02-21 04:00:00,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:00:00,322 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:00:00,322 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:00:00,322 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:00:00,322 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:00:00,323 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:00:00,323 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:00,323 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:00:00,323 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:00:00,323 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration10_Loop [2022-02-21 04:00:00,323 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:00:00,323 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:00:00,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:00:00,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:00:00,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:00:00,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:00:00,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:00:00,436 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:00:00,436 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:00:00,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:00,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:00,455 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:00,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 04:00:00,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:00:00,459 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:00:00,476 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:00:00,476 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:00:00,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:00,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:00,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:00,494 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:00,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 04:00:00,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:00:00,497 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:00:00,518 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:00:00,518 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:00:00,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:00,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:00,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:00,550 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:00,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-02-21 04:00:00,553 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:00:00,553 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:00:00,574 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:00:00,574 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:00:00,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:00,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:00,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:00,594 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:00,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-02-21 04:00:00,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:00:00,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:00:00,622 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:00:00,622 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:00:00,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:00,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:00,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:00,641 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:00,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-02-21 04:00:00,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:00:00,643 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:00:00,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-02-21 04:00:00,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:00,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:00,678 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:00,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-02-21 04:00:00,680 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:00:00,680 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:00:01,035 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:00:01,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:01,041 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:00:01,041 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:00:01,041 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:00:01,041 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:00:01,041 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:00:01,041 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:01,041 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:00:01,041 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:00:01,041 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration10_Loop [2022-02-21 04:00:01,041 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:00:01,041 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:00:01,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:00:01,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:00:01,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:00:01,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:00:01,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:00:01,211 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:00:01,212 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:00:01,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:01,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:01,214 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:01,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-02-21 04:00:01,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:00:01,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:00:01,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:00:01,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:00:01,223 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 04:00:01,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:00:01,225 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:00:01,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:00:01,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:00:01,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-02-21 04:00:01,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:01,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:01,257 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:01,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:00:01,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-02-21 04:00:01,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:00:01,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:00:01,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:00:01,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:00:01,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:00:01,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:00:01,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:00:01,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:00:01,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:01,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:01,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:01,312 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:01,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-02-21 04:00:01,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:00:01,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:00:01,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:00:01,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:00:01,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:00:01,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:00:01,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:00:01,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:00:01,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:00:01,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:01,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:01,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:01,340 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:01,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-02-21 04:00:01,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:00:01,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:00:01,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:00:01,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:00:01,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:00:01,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:00:01,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:00:01,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:00:01,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:00:01,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:01,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:01,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:01,421 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:01,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-02-21 04:00:01,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:00:01,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:00:01,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:00:01,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:00:01,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:00:01,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:00:01,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:00:01,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:00:01,457 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:00:01,460 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 04:00:01,461 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 04:00:01,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:01,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:01,462 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:01,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-02-21 04:00:01,464 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:00:01,464 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:00:01,464 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:00:01,465 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~i~0#1) = 7*ULTIMATE.start_main_~n~0#1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 04:00:01,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:01,514 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:00:01,517 INFO L390 LassoCheck]: Loop: "assume !(0 == __VERIFIER_assert_~cond#1);" "assume { :end_inline___VERIFIER_assert } true;" "main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "assume { :end_inline___VERIFIER_assert } true;" "main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "assume { :end_inline___VERIFIER_assert } true;" "main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "assume { :end_inline___VERIFIER_assert } true;" "main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "assume { :end_inline___VERIFIER_assert } true;" "main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~k~0#1 < main_~j~0#1);" "main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~j~0#1 < 3 * main_~i~0#1);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1;" "assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1;" "assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" [2022-02-21 04:00:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:01,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:00:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:01,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:00:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:01,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:00:01,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {19735#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(9, 2);~__BLAST_NONDET~0 := 0; {19735#unseeded} is VALID [2022-02-21 04:00:01,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {19735#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {19735#unseeded} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {19735#unseeded} is VALID [2022-02-21 04:00:01,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {19735#unseeded} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {19735#unseeded} is VALID [2022-02-21 04:00:01,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {19735#unseeded} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {19735#unseeded} is VALID [2022-02-21 04:00:01,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {19735#unseeded} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {19735#unseeded} main_~i~0#1 := 0; {19735#unseeded} is VALID [2022-02-21 04:00:01,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {19735#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {19735#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {19735#unseeded} is VALID [2022-02-21 04:00:01,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {19735#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {19735#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {19735#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {19735#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {19735#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {19735#unseeded} is VALID [2022-02-21 04:00:01,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {19735#unseeded} assume { :end_inline___VERIFIER_assert } true; {19735#unseeded} is VALID [2022-02-21 04:00:01,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {19735#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {19735#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {19735#unseeded} is VALID [2022-02-21 04:00:01,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {19735#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {19735#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {19735#unseeded} is VALID [2022-02-21 04:00:01,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {19735#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {19735#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {19735#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {19735#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {19735#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {19735#unseeded} is VALID [2022-02-21 04:00:01,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {19735#unseeded} assume { :end_inline___VERIFIER_assert } true; {19735#unseeded} is VALID [2022-02-21 04:00:01,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {19735#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {19735#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {19735#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {19735#unseeded} is VALID [2022-02-21 04:00:01,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {19735#unseeded} assume { :end_inline___VERIFIER_assert } true; {19735#unseeded} is VALID [2022-02-21 04:00:01,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {19735#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {19735#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {19735#unseeded} is VALID [2022-02-21 04:00:01,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {19735#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {19735#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {19735#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19735#unseeded} is VALID [2022-02-21 04:00:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:01,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:00:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:01,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:00:01,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,900 INFO L290 TraceCheckUtils]: 3: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,900 INFO L290 TraceCheckUtils]: 4: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} assume !(main_~k~0#1 < main_~j~0#1); {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} assume !(main_~j~0#1 < 3 * main_~i~0#1); {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 04:00:01,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {19738#(>= oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {19918#(<= (+ (div (+ (* (- 7) |ULTIMATE.start_main_~n~0#1|) oldRank0) (- 4)) 1) |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 04:00:01,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {19918#(<= (+ (div (+ (* (- 7) |ULTIMATE.start_main_~n~0#1|) oldRank0) (- 4)) 1) |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {19922#(and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div (+ (* (- 7) |ULTIMATE.start_main_~n~0#1|) oldRank0) (- 4)) 1) |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 04:00:01,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {19922#(and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div (+ (* (- 7) |ULTIMATE.start_main_~n~0#1|) oldRank0) (- 4)) 1) |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {19926#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div (+ (* (- 7) |ULTIMATE.start_main_~n~0#1|) oldRank0) (- 4)) 1) |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 04:00:01,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {19926#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div (+ (* (- 7) |ULTIMATE.start_main_~n~0#1|) oldRank0) (- 4)) 1) |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {19748#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 7 |ULTIMATE.start_main_~n~0#1|) (* (- 4) |ULTIMATE.start_main_~i~0#1|)))) unseeded)} is VALID [2022-02-21 04:00:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-21 04:00:01,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:01,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:00:01,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 26 letters. [2022-02-21 04:00:01,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,920 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 04:00:01,921 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 244 states and 274 transitions. cyclomatic complexity: 38 Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:01,986 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 244 states and 274 transitions. cyclomatic complexity: 38. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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 539 states and 617 transitions. Complement of second has 8 states. [2022-02-21 04:00:01,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 04:00:01,986 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:00:01,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 244 states and 274 transitions. cyclomatic complexity: 38 [2022-02-21 04:00:01,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:00:01,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:00:01,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:01,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:00:01,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:00:01,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:00:01,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 539 states and 617 transitions. [2022-02-21 04:00:01,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:00:01,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:00:01,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:00:01,989 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 244 states and 274 transitions. cyclomatic complexity: 38 [2022-02-21 04:00:01,991 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:00:01,991 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:01,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:00:01,992 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:00:01,992 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 539 states and 617 transitions. cyclomatic complexity: 101 [2022-02-21 04:00:01,992 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:00:01,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 34 letters. Loop has 26 letters. [2022-02-21 04:00:01,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 26 letters. [2022-02-21 04:00:01,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 34 letters. Loop has 26 letters. [2022-02-21 04:00:01,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 4 letters. [2022-02-21 04:00:01,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 04:00:01,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 1 letters. Loop has 4 letters. [2022-02-21 04:00:01,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 50 letters. Loop has 4 letters. [2022-02-21 04:00:01,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 4 letters. [2022-02-21 04:00:01,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 50 letters. Loop has 4 letters. [2022-02-21 04:00:01,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 539 letters. Loop has 539 letters. [2022-02-21 04:00:01,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 539 letters. Loop has 539 letters. [2022-02-21 04:00:01,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 539 letters. Loop has 539 letters. [2022-02-21 04:00:01,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 244 letters. Loop has 244 letters. [2022-02-21 04:00:01,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 244 letters. Loop has 244 letters. [2022-02-21 04:00:01,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 244 letters. Loop has 244 letters. [2022-02-21 04:00:01,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:00:01,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 04:00:01,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:00:01,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 56 letters. Loop has 26 letters. [2022-02-21 04:00:01,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 26 letters. [2022-02-21 04:00:01,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 56 letters. Loop has 26 letters. [2022-02-21 04:00:01,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 57 letters. Loop has 26 letters. [2022-02-21 04:00:01,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 26 letters. [2022-02-21 04:00:01,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 57 letters. Loop has 26 letters. [2022-02-21 04:00:01,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 36 letters. Loop has 26 letters. [2022-02-21 04:00:01,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 26 letters. [2022-02-21 04:00:01,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:01,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 36 letters. Loop has 26 letters. [2022-02-21 04:00:02,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 37 letters. Loop has 26 letters. [2022-02-21 04:00:02,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 26 letters. [2022-02-21 04:00:02,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 37 letters. Loop has 26 letters. [2022-02-21 04:00:02,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 34 letters. Loop has 26 letters. [2022-02-21 04:00:02,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 26 letters. [2022-02-21 04:00:02,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 34 letters. Loop has 26 letters. [2022-02-21 04:00:02,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 35 letters. Loop has 26 letters. [2022-02-21 04:00:02,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 26 letters. [2022-02-21 04:00:02,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 35 letters. Loop has 26 letters. [2022-02-21 04:00:02,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 39 letters. Loop has 26 letters. [2022-02-21 04:00:02,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 26 letters. [2022-02-21 04:00:02,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 39 letters. Loop has 26 letters. [2022-02-21 04:00:02,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 40 letters. Loop has 26 letters. [2022-02-21 04:00:02,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 26 letters. [2022-02-21 04:00:02,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 40 letters. Loop has 26 letters. [2022-02-21 04:00:02,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 54 letters. Loop has 26 letters. [2022-02-21 04:00:02,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 26 letters. [2022-02-21 04:00:02,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 54 letters. Loop has 26 letters. [2022-02-21 04:00:02,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 55 letters. Loop has 26 letters. [2022-02-21 04:00:02,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 26 letters. [2022-02-21 04:00:02,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 55 letters. Loop has 26 letters. [2022-02-21 04:00:02,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:02,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:02,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:02,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 50 letters. Loop has 4 letters. [2022-02-21 04:00:02,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 4 letters. [2022-02-21 04:00:02,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 50 letters. Loop has 4 letters. [2022-02-21 04:00:02,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:02,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:02,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:02,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 51 letters. Loop has 4 letters. [2022-02-21 04:00:02,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 4 letters. [2022-02-21 04:00:02,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 51 letters. Loop has 4 letters. [2022-02-21 04:00:02,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 49 letters. Loop has 26 letters. [2022-02-21 04:00:02,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 26 letters. [2022-02-21 04:00:02,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 49 letters. Loop has 26 letters. [2022-02-21 04:00:02,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 48 letters. Loop has 26 letters. [2022-02-21 04:00:02,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 26 letters. [2022-02-21 04:00:02,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 48 letters. Loop has 26 letters. [2022-02-21 04:00:02,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 47 letters. Loop has 26 letters. [2022-02-21 04:00:02,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 26 letters. [2022-02-21 04:00:02,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 47 letters. Loop has 26 letters. [2022-02-21 04:00:02,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 46 letters. Loop has 26 letters. [2022-02-21 04:00:02,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 26 letters. [2022-02-21 04:00:02,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 46 letters. Loop has 26 letters. [2022-02-21 04:00:02,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 45 letters. Loop has 26 letters. [2022-02-21 04:00:02,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 26 letters. [2022-02-21 04:00:02,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 45 letters. Loop has 26 letters. [2022-02-21 04:00:02,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 44 letters. Loop has 26 letters. [2022-02-21 04:00:02,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 26 letters. [2022-02-21 04:00:02,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 44 letters. Loop has 26 letters. [2022-02-21 04:00:02,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 43 letters. Loop has 26 letters. [2022-02-21 04:00:02,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 26 letters. [2022-02-21 04:00:02,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 43 letters. Loop has 26 letters. [2022-02-21 04:00:02,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 42 letters. Loop has 26 letters. [2022-02-21 04:00:02,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 26 letters. [2022-02-21 04:00:02,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 42 letters. Loop has 26 letters. [2022-02-21 04:00:02,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 41 letters. Loop has 26 letters. [2022-02-21 04:00:02,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 26 letters. [2022-02-21 04:00:02,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 41 letters. Loop has 26 letters. [2022-02-21 04:00:02,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 38 letters. Loop has 26 letters. [2022-02-21 04:00:02,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 26 letters. [2022-02-21 04:00:02,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 38 letters. Loop has 26 letters. [2022-02-21 04:00:02,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 51 letters. Loop has 26 letters. [2022-02-21 04:00:02,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 26 letters. [2022-02-21 04:00:02,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 51 letters. Loop has 26 letters. [2022-02-21 04:00:02,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 50 letters. Loop has 26 letters. [2022-02-21 04:00:02,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 26 letters. [2022-02-21 04:00:02,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 50 letters. Loop has 26 letters. [2022-02-21 04:00:02,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 4 letters. [2022-02-21 04:00:02,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 4 letters. [2022-02-21 04:00:02,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 1 letters. Loop has 4 letters. [2022-02-21 04:00:02,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:02,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:02,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:02,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 50 letters. Loop has 4 letters. [2022-02-21 04:00:02,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 4 letters. [2022-02-21 04:00:02,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 50 letters. Loop has 4 letters. [2022-02-21 04:00:02,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:02,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:02,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:02,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 244 states and 274 transitions. cyclomatic complexity: 38 Stem has 51 letters. Loop has 4 letters. [2022-02-21 04:00:02,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 4 letters. [2022-02-21 04:00:02,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 539 states and 617 transitions. cyclomatic complexity: 101 Stem has 51 letters. Loop has 4 letters. [2022-02-21 04:00:02,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,027 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:00:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:02,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-02-21 04:00:02,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 34 letters. Loop has 26 letters. [2022-02-21 04:00:02,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 60 letters. Loop has 26 letters. [2022-02-21 04:00:02,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 34 letters. Loop has 52 letters. [2022-02-21 04:00:02,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:02,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 539 states and 617 transitions. cyclomatic complexity: 101 [2022-02-21 04:00:02,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:00:02,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 539 states to 347 states and 393 transitions. [2022-02-21 04:00:02,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-02-21 04:00:02,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-02-21 04:00:02,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 347 states and 393 transitions. [2022-02-21 04:00:02,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:00:02,042 INFO L681 BuchiCegarLoop]: Abstraction has 347 states and 393 transitions. [2022-02-21 04:00:02,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states and 393 transitions. [2022-02-21 04:00:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 316. [2022-02-21 04:00:02,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:00:02,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 347 states and 393 transitions. Second operand has 316 states, 316 states have (on average 1.1265822784810127) internal successors, (356), 315 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:02,046 INFO L74 IsIncluded]: Start isIncluded. First operand 347 states and 393 transitions. Second operand has 316 states, 316 states have (on average 1.1265822784810127) internal successors, (356), 315 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:02,046 INFO L87 Difference]: Start difference. First operand 347 states and 393 transitions. Second operand has 316 states, 316 states have (on average 1.1265822784810127) internal successors, (356), 315 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:02,046 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:00:02,059 INFO L93 Difference]: Finished difference Result 699 states and 802 transitions. [2022-02-21 04:00:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 802 transitions. [2022-02-21 04:00:02,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:00:02,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:00:02,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 316 states, 316 states have (on average 1.1265822784810127) internal successors, (356), 315 states have internal predecessors, (356), 0 states have call successors, (0), 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 347 states and 393 transitions. [2022-02-21 04:00:02,061 INFO L87 Difference]: Start difference. First operand has 316 states, 316 states have (on average 1.1265822784810127) internal successors, (356), 315 states have internal predecessors, (356), 0 states have call successors, (0), 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 347 states and 393 transitions. [2022-02-21 04:00:02,062 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:00:02,076 INFO L93 Difference]: Finished difference Result 715 states and 818 transitions. [2022-02-21 04:00:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 818 transitions. [2022-02-21 04:00:02,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:00:02,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:00:02,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:00:02,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:00:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.1265822784810127) internal successors, (356), 315 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 356 transitions. [2022-02-21 04:00:02,081 INFO L704 BuchiCegarLoop]: Abstraction has 316 states and 356 transitions. [2022-02-21 04:00:02,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:00:02,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 04:00:02,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-02-21 04:00:02,082 INFO L87 Difference]: Start difference. First operand 316 states and 356 transitions. Second operand has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:02,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-02-21 04:00:02,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:00:02,768 INFO L93 Difference]: Finished difference Result 508 states and 557 transitions. [2022-02-21 04:00:02,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-21 04:00:02,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:02,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:00:02,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 508 states and 557 transitions. [2022-02-21 04:00:02,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:00:02,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 508 states to 388 states and 429 transitions. [2022-02-21 04:00:02,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 04:00:02,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 04:00:02,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 388 states and 429 transitions. [2022-02-21 04:00:02,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:00:02,839 INFO L681 BuchiCegarLoop]: Abstraction has 388 states and 429 transitions. [2022-02-21 04:00:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states and 429 transitions. [2022-02-21 04:00:02,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 355. [2022-02-21 04:00:02,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:00:02,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 388 states and 429 transitions. Second operand has 355 states, 355 states have (on average 1.115492957746479) internal successors, (396), 354 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:02,843 INFO L74 IsIncluded]: Start isIncluded. First operand 388 states and 429 transitions. Second operand has 355 states, 355 states have (on average 1.115492957746479) internal successors, (396), 354 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:02,843 INFO L87 Difference]: Start difference. First operand 388 states and 429 transitions. Second operand has 355 states, 355 states have (on average 1.115492957746479) internal successors, (396), 354 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:02,844 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:00:02,858 INFO L93 Difference]: Finished difference Result 767 states and 869 transitions. [2022-02-21 04:00:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 869 transitions. [2022-02-21 04:00:02,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:00:02,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:00:02,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 355 states have (on average 1.115492957746479) internal successors, (396), 354 states have internal predecessors, (396), 0 states have call successors, (0), 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 388 states and 429 transitions. [2022-02-21 04:00:02,860 INFO L87 Difference]: Start difference. First operand has 355 states, 355 states have (on average 1.115492957746479) internal successors, (396), 354 states have internal predecessors, (396), 0 states have call successors, (0), 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 388 states and 429 transitions. [2022-02-21 04:00:02,860 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:00:02,875 INFO L93 Difference]: Finished difference Result 767 states and 869 transitions. [2022-02-21 04:00:02,875 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 869 transitions. [2022-02-21 04:00:02,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:00:02,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:00:02,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:00:02,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:00:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 355 states have (on average 1.115492957746479) internal successors, (396), 354 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 396 transitions. [2022-02-21 04:00:02,880 INFO L704 BuchiCegarLoop]: Abstraction has 355 states and 396 transitions. [2022-02-21 04:00:02,880 INFO L587 BuchiCegarLoop]: Abstraction has 355 states and 396 transitions. [2022-02-21 04:00:02,881 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2022-02-21 04:00:02,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 355 states and 396 transitions. [2022-02-21 04:00:02,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:00:02,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:00:02,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:00:02,882 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:00:02,882 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:00:02,883 INFO L791 eck$LassoCheckResult]: Stem: 23011#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(9, 2);~__BLAST_NONDET~0 := 0; 23012#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 23013#L30 assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); 23014#L31 assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); 23018#L32 assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); 23017#L33 assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; 23015#L33-1 main_~i~0#1 := 0; 23016#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 23037#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 23101#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23059#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 23061#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 23233#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23232#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23231#L18-2 assume { :end_inline___VERIFIER_assert } true; 23230#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 23205#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 23202#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 23203#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 23023#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23024#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 23027#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 23028#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23358#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23356#L18-2 assume { :end_inline___VERIFIER_assert } true; 23354#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 23348#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23347#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23345#L18-2 assume { :end_inline___VERIFIER_assert } true; 23343#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 23334#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 23332#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 23262#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 23260#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23259#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23258#L18-2 assume { :end_inline___VERIFIER_assert } true; 23257#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 23256#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23255#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23254#L18-2 assume { :end_inline___VERIFIER_assert } true; 23253#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 23252#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23251#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23249#L18-2 assume { :end_inline___VERIFIER_assert } true; 23248#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 23072#L36-3 assume !(main_~k~0#1 < main_~j~0#1); 23068#L35-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 23063#L35-3 assume !(main_~j~0#1 < 3 * main_~i~0#1); 23064#L34-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 23044#L34-3 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; 23041#L35-3 assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; 23042#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23020#L18 [2022-02-21 04:00:02,884 INFO L793 eck$LassoCheckResult]: Loop: 23020#L18 assume !(0 == __VERIFIER_assert_~cond#1); 23032#L18-2 assume { :end_inline___VERIFIER_assert } true; 23029#L36-2 main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 23019#L36-3 assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23020#L18 [2022-02-21 04:00:02,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:00:02,885 INFO L85 PathProgramCache]: Analyzing trace with hash -586107213, now seen corresponding path program 7 times [2022-02-21 04:00:02,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:00:02,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282415758] [2022-02-21 04:00:02,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:00:02,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:00:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:00:02,914 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:00:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:00:02,930 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:00:02,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:00:02,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2619672, now seen corresponding path program 1 times [2022-02-21 04:00:02,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:00:02,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808870856] [2022-02-21 04:00:02,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:00:02,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:00:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:00:02,936 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:00:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:00:02,938 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:00:02,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:00:02,939 INFO L85 PathProgramCache]: Analyzing trace with hash -474347830, now seen corresponding path program 8 times [2022-02-21 04:00:02,939 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:00:02,939 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838659329] [2022-02-21 04:00:02,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:00:02,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:00:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:00:02,967 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:00:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:00:02,996 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:00:03,028 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:00:03,029 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:00:03,029 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:00:03,029 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:00:03,029 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:00:03,029 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:03,029 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:00:03,029 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:00:03,029 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration11_Loop [2022-02-21 04:00:03,029 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:00:03,029 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:00:03,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:00:03,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 04:00:03,169 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:00:03,169 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:00:03,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:03,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:03,170 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:03,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-02-21 04:00:03,173 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:00:03,173 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:00:03,194 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:00:03,194 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:00:03,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:03,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:03,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:03,211 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:03,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-02-21 04:00:03,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:00:03,213 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:00:03,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:03,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:03,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:03,252 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:03,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-02-21 04:00:03,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:00:03,255 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:00:03,883 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:00:03,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:03,890 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:00:03,891 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:00:03,891 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:00:03,891 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:00:03,891 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:00:03,891 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:03,891 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:00:03,891 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:00:03,891 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested9.i_Iteration11_Loop [2022-02-21 04:00:03,891 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:00:03,891 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:00:03,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:00:03,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:00:04,102 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:00:04,102 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:00:04,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:04,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:04,103 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:04,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-02-21 04:00:04,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:00:04,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:00:04,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:00:04,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:00:04,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:00:04,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:00:04,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:00:04,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:00:04,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:00:04,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:04,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:04,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:04,132 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:04,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-02-21 04:00:04,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:00:04,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:00:04,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:00:04,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:00:04,141 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-02-21 04:00:04,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:00:04,145 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-02-21 04:00:04,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:00:04,155 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:00:04,159 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:00:04,159 INFO L444 ModelExtractionUtils]: 5 out of 8 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:00:04,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:00:04,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:00:04,160 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:00:04,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-02-21 04:00:04,170 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:00:04,170 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:00:04,170 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:00:04,170 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~j~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2022-02-21 04:00:04,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:04,203 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:00:04,206 INFO L390 LassoCheck]: Loop: "assume !(0 == __VERIFIER_assert_~cond#1);" "assume { :end_inline___VERIFIER_assert } true;" "main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" [2022-02-21 04:00:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:04,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:00:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:04,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:00:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:04,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:00:04,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {25235#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(9, 2);~__BLAST_NONDET~0 := 0; {25235#unseeded} is VALID [2022-02-21 04:00:04,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {25235#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {25235#unseeded} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {25235#unseeded} is VALID [2022-02-21 04:00:04,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {25235#unseeded} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {25235#unseeded} is VALID [2022-02-21 04:00:04,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {25235#unseeded} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {25235#unseeded} is VALID [2022-02-21 04:00:04,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {25235#unseeded} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {25235#unseeded} main_~i~0#1 := 0; {25235#unseeded} is VALID [2022-02-21 04:00:04,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {25235#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {25235#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {25235#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {25235#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {25235#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {25235#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {25235#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {25235#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {25235#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {25235#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {25235#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {25235#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {25235#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,316 INFO L290 TraceCheckUtils]: 32: Hoare triple {25235#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,318 INFO L290 TraceCheckUtils]: 40: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,319 INFO L290 TraceCheckUtils]: 45: Hoare triple {25235#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,319 INFO L290 TraceCheckUtils]: 46: Hoare triple {25235#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,319 INFO L290 TraceCheckUtils]: 47: Hoare triple {25235#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,352 INFO L290 TraceCheckUtils]: 48: Hoare triple {25235#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,352 INFO L290 TraceCheckUtils]: 49: Hoare triple {25235#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,352 INFO L290 TraceCheckUtils]: 50: Hoare triple {25235#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,353 INFO L290 TraceCheckUtils]: 51: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:04,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:00:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:04,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:00:04,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {25238#(>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {25238#(>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} is VALID [2022-02-21 04:00:04,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {25238#(>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {25238#(>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} is VALID [2022-02-21 04:00:04,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {25238#(>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25412#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) (+ |ULTIMATE.start_main_~k~0#1| oldRank0))} is VALID [2022-02-21 04:00:04,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {25412#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) (+ |ULTIMATE.start_main_~k~0#1| oldRank0))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25248#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))) unseeded)} is VALID [2022-02-21 04:00:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:00:04,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:04,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:00:04,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,392 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:00:04,392 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 355 states and 396 transitions. cyclomatic complexity: 54 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:04,427 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 355 states and 396 transitions. cyclomatic complexity: 54. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 410 states and 453 transitions. Complement of second has 7 states. [2022-02-21 04:00:04,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:00:04,427 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:00:04,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 355 states and 396 transitions. cyclomatic complexity: 54 [2022-02-21 04:00:04,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:00:04,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:00:04,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:04,428 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:00:04,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:00:04,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 410 states and 453 transitions. [2022-02-21 04:00:04,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:00:04,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:00:04,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:00:04,431 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 355 states and 396 transitions. cyclomatic complexity: 54 [2022-02-21 04:00:04,432 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:00:04,432 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:04,432 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:00:04,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 19 transitions. cyclomatic complexity: 17 [2022-02-21 04:00:04,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:00:04,432 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:00:04,432 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 410 states and 453 transitions. cyclomatic complexity: 56 [2022-02-21 04:00:04,433 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:00:04,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 410 letters. Loop has 410 letters. [2022-02-21 04:00:04,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 410 letters. Loop has 410 letters. [2022-02-21 04:00:04,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 410 letters. Loop has 410 letters. [2022-02-21 04:00:04,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 355 letters. Loop has 355 letters. [2022-02-21 04:00:04,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 355 letters. Loop has 355 letters. [2022-02-21 04:00:04,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 355 letters. Loop has 355 letters. [2022-02-21 04:00:04,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:00:04,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 04:00:04,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:00:04,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 54 letters. Loop has 4 letters. [2022-02-21 04:00:04,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 4 letters. [2022-02-21 04:00:04,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 4 letters. [2022-02-21 04:00:04,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:04,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:04,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:04,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 55 letters. Loop has 4 letters. [2022-02-21 04:00:04,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 4 letters. [2022-02-21 04:00:04,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 4 letters. [2022-02-21 04:00:04,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:04,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:04,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:04,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 55 letters. Loop has 4 letters. [2022-02-21 04:00:04,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 4 letters. [2022-02-21 04:00:04,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 4 letters. [2022-02-21 04:00:04,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 54 letters. Loop has 4 letters. [2022-02-21 04:00:04,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 4 letters. [2022-02-21 04:00:04,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 4 letters. [2022-02-21 04:00:04,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,445 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:00:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-02-21 04:00:04,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,446 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:00:04,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:00:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:04,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:00:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:04,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:00:04,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {25235#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(9, 2);~__BLAST_NONDET~0 := 0; {25235#unseeded} is VALID [2022-02-21 04:00:04,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {25235#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {25235#unseeded} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {25235#unseeded} is VALID [2022-02-21 04:00:04,540 INFO L290 TraceCheckUtils]: 3: Hoare triple {25235#unseeded} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {25235#unseeded} is VALID [2022-02-21 04:00:04,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {25235#unseeded} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {25235#unseeded} is VALID [2022-02-21 04:00:04,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {25235#unseeded} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {25235#unseeded} main_~i~0#1 := 0; {25235#unseeded} is VALID [2022-02-21 04:00:04,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {25235#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {25235#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {25235#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {25235#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {25235#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {25235#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {25235#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {25235#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {25235#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {25235#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {25235#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {25235#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {25235#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {25235#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {25235#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {25235#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {25235#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {25235#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {25235#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,567 INFO L290 TraceCheckUtils]: 50: Hoare triple {25235#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,568 INFO L290 TraceCheckUtils]: 51: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:04,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:00:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:04,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:00:04,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {25238#(>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {25238#(>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} is VALID [2022-02-21 04:00:04,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {25238#(>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {25238#(>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} is VALID [2022-02-21 04:00:04,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {25238#(>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25999#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) (+ |ULTIMATE.start_main_~k~0#1| oldRank0))} is VALID [2022-02-21 04:00:04,602 INFO L290 TraceCheckUtils]: 3: Hoare triple {25999#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) (+ |ULTIMATE.start_main_~k~0#1| oldRank0))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25248#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))) unseeded)} is VALID [2022-02-21 04:00:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:00:04,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:04,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:00:04,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,611 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:00:04,611 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 355 states and 396 transitions. cyclomatic complexity: 54 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:04,648 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 355 states and 396 transitions. cyclomatic complexity: 54. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 410 states and 453 transitions. Complement of second has 7 states. [2022-02-21 04:00:04,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:00:04,649 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:00:04,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 355 states and 396 transitions. cyclomatic complexity: 54 [2022-02-21 04:00:04,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:00:04,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:00:04,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:04,650 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:00:04,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:00:04,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 410 states and 453 transitions. [2022-02-21 04:00:04,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:00:04,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:00:04,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:00:04,652 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 355 states and 396 transitions. cyclomatic complexity: 54 [2022-02-21 04:00:04,652 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:00:04,652 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:04,652 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:00:04,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 19 transitions. cyclomatic complexity: 17 [2022-02-21 04:00:04,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:00:04,653 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:00:04,653 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 410 states and 453 transitions. cyclomatic complexity: 56 [2022-02-21 04:00:04,653 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:00:04,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 410 letters. Loop has 410 letters. [2022-02-21 04:00:04,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 410 letters. Loop has 410 letters. [2022-02-21 04:00:04,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 410 letters. Loop has 410 letters. [2022-02-21 04:00:04,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 355 letters. Loop has 355 letters. [2022-02-21 04:00:04,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 355 letters. Loop has 355 letters. [2022-02-21 04:00:04,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 355 letters. Loop has 355 letters. [2022-02-21 04:00:04,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:00:04,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 04:00:04,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:00:04,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 54 letters. Loop has 4 letters. [2022-02-21 04:00:04,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 4 letters. [2022-02-21 04:00:04,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 4 letters. [2022-02-21 04:00:04,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:04,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:04,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:04,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 55 letters. Loop has 4 letters. [2022-02-21 04:00:04,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 4 letters. [2022-02-21 04:00:04,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 4 letters. [2022-02-21 04:00:04,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 55 letters. Loop has 4 letters. [2022-02-21 04:00:04,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 4 letters. [2022-02-21 04:00:04,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 4 letters. [2022-02-21 04:00:04,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 54 letters. Loop has 4 letters. [2022-02-21 04:00:04,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 4 letters. [2022-02-21 04:00:04,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 4 letters. [2022-02-21 04:00:04,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:04,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:04,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 453 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:04,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,665 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:00:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-02-21 04:00:04,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,666 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:00:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:00:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:04,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:00:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:04,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:00:04,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {25235#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(9, 2);~__BLAST_NONDET~0 := 0; {25235#unseeded} is VALID [2022-02-21 04:00:04,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {25235#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post6#1, main_#t~post5#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~l~0#1, main_~m~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~m~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~m~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~l~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {25235#unseeded} assume !!(-1000000 < main_~n~0#1 && main_~n~0#1 < 1000000); {25235#unseeded} is VALID [2022-02-21 04:00:04,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {25235#unseeded} assume !!(-1000000 < main_~m~0#1 && main_~m~0#1 < 1000000); {25235#unseeded} is VALID [2022-02-21 04:00:04,788 INFO L290 TraceCheckUtils]: 4: Hoare triple {25235#unseeded} assume !!(-1000000 < main_~l~0#1 && main_~l~0#1 < 1000000); {25235#unseeded} is VALID [2022-02-21 04:00:04,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {25235#unseeded} assume 3 * main_~n~0#1 <= main_~m~0#1 + main_~l~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {25235#unseeded} main_~i~0#1 := 0; {25235#unseeded} is VALID [2022-02-21 04:00:04,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {25235#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {25235#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {25235#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {25235#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {25235#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {25235#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {25235#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {25235#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {25235#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {25235#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {25235#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {25235#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {25235#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {25235#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,799 INFO L290 TraceCheckUtils]: 41: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,799 INFO L290 TraceCheckUtils]: 42: Hoare triple {25235#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {25235#unseeded} assume { :end_inline___VERIFIER_assert } true; {25235#unseeded} is VALID [2022-02-21 04:00:04,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {25235#unseeded} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {25235#unseeded} assume !(main_~k~0#1 < main_~j~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {25235#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {25235#unseeded} assume !(main_~j~0#1 < 3 * main_~i~0#1); {25235#unseeded} is VALID [2022-02-21 04:00:04,801 INFO L290 TraceCheckUtils]: 48: Hoare triple {25235#unseeded} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {25235#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 2 * main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {25235#unseeded} assume !!(main_~j~0#1 < 3 * main_~i~0#1);main_~k~0#1 := main_~i~0#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {25235#unseeded} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25235#unseeded} is VALID [2022-02-21 04:00:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:04,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:00:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:00:04,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:00:04,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {25238#(>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {25238#(>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} is VALID [2022-02-21 04:00:04,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {25238#(>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} assume { :end_inline___VERIFIER_assert } true; {25238#(>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} is VALID [2022-02-21 04:00:04,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {25238#(>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} main_#t~post6#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {26586#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) (+ |ULTIMATE.start_main_~k~0#1| oldRank0))} is VALID [2022-02-21 04:00:04,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {26586#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) (+ |ULTIMATE.start_main_~k~0#1| oldRank0))} assume !!(main_~k~0#1 < main_~j~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 - main_~i~0#1 <= 2 * main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {25248#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))) unseeded)} is VALID [2022-02-21 04:00:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:00:04,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:04,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:00:04,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,854 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:00:04,854 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 355 states and 396 transitions. cyclomatic complexity: 54 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:04,911 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 355 states and 396 transitions. cyclomatic complexity: 54. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 610 states and 658 transitions. Complement of second has 6 states. [2022-02-21 04:00:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:00:04,911 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:00:04,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 355 states and 396 transitions. cyclomatic complexity: 54 [2022-02-21 04:00:04,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:00:04,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:00:04,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:04,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:00:04,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:00:04,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:00:04,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 610 states and 658 transitions. [2022-02-21 04:00:04,920 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:00:04,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:00:04,921 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 355 states and 396 transitions. cyclomatic complexity: 54 [2022-02-21 04:00:04,921 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:00:04,921 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:04,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:00:04,922 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:00:04,922 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 610 states and 658 transitions. cyclomatic complexity: 61 [2022-02-21 04:00:04,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 610 states and 658 transitions. cyclomatic complexity: 61 [2022-02-21 04:00:04,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:00:04,922 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:00:04,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 610 states and 658 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:00:04,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 04:00:04,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 610 states and 658 transitions. cyclomatic complexity: 61 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:00:04,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 610 letters. Loop has 610 letters. [2022-02-21 04:00:04,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 610 letters. Loop has 610 letters. [2022-02-21 04:00:04,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 610 states and 658 transitions. cyclomatic complexity: 61 Stem has 610 letters. Loop has 610 letters. [2022-02-21 04:00:04,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 355 letters. Loop has 355 letters. [2022-02-21 04:00:04,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 355 letters. Loop has 355 letters. [2022-02-21 04:00:04,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 610 states and 658 transitions. cyclomatic complexity: 61 Stem has 355 letters. Loop has 355 letters. [2022-02-21 04:00:04,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:00:04,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 04:00:04,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 610 states and 658 transitions. cyclomatic complexity: 61 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:00:04,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 54 letters. Loop has 4 letters. [2022-02-21 04:00:04,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 4 letters. [2022-02-21 04:00:04,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 610 states and 658 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 4 letters. [2022-02-21 04:00:04,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:04,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:04,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 610 states and 658 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 4 letters. [2022-02-21 04:00:04,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 55 letters. Loop has 4 letters. [2022-02-21 04:00:04,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 4 letters. [2022-02-21 04:00:04,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 610 states and 658 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 4 letters. [2022-02-21 04:00:04,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 610 states and 658 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 355 states and 396 transitions. cyclomatic complexity: 54 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:00:04,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 04:00:04,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 610 states and 658 transitions. cyclomatic complexity: 61 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:00:04,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,932 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:00:04,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:00:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-02-21 04:00:04,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 52 letters. Loop has 4 letters. [2022-02-21 04:00:04,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 56 letters. Loop has 4 letters. [2022-02-21 04:00:04,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:00:04,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:00:04,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 610 states and 658 transitions. cyclomatic complexity: 61 [2022-02-21 04:00:04,945 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:00:04,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 610 states to 0 states and 0 transitions. [2022-02-21 04:00:04,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:00:04,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:00:04,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:00:04,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:00:04,946 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:00:04,946 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:00:04,946 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:00:04,946 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2022-02-21 04:00:04,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:00:04,947 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:00:04,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:00:04,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:00:04 BoogieIcfgContainer [2022-02-21 04:00:04,952 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:00:04,952 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:00:04,952 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:00:04,953 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:00:04,953 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:59:42" (3/4) ... [2022-02-21 04:00:04,955 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:00:04,955 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:00:04,956 INFO L158 Benchmark]: Toolchain (without parser) took 22806.94ms. Allocated memory was 96.5MB in the beginning and 264.2MB in the end (delta: 167.8MB). Free memory was 64.1MB in the beginning and 134.1MB in the end (delta: -70.0MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. [2022-02-21 04:00:04,956 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 51.6MB in the beginning and 51.6MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:00:04,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.61ms. Allocated memory is still 96.5MB. Free memory was 63.9MB in the beginning and 71.6MB in the end (delta: -7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:00:04,957 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.54ms. Allocated memory is still 96.5MB. Free memory was 71.6MB in the beginning and 69.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:00:04,957 INFO L158 Benchmark]: Boogie Preprocessor took 33.18ms. Allocated memory is still 96.5MB. Free memory was 69.9MB in the beginning and 68.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:00:04,957 INFO L158 Benchmark]: RCFGBuilder took 303.08ms. Allocated memory is still 96.5MB. Free memory was 68.9MB in the beginning and 57.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 04:00:04,957 INFO L158 Benchmark]: BuchiAutomizer took 22159.43ms. Allocated memory was 96.5MB in the beginning and 264.2MB in the end (delta: 167.8MB). Free memory was 57.3MB in the beginning and 134.1MB in the end (delta: -76.8MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. [2022-02-21 04:00:04,957 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 264.2MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:00:04,958 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 51.6MB in the beginning and 51.6MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.61ms. Allocated memory is still 96.5MB. Free memory was 63.9MB in the beginning and 71.6MB in the end (delta: -7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.54ms. Allocated memory is still 96.5MB. Free memory was 71.6MB in the beginning and 69.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.18ms. Allocated memory is still 96.5MB. Free memory was 69.9MB in the beginning and 68.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 303.08ms. Allocated memory is still 96.5MB. Free memory was 68.9MB in the beginning and 57.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 22159.43ms. Allocated memory was 96.5MB in the beginning and 264.2MB in the end (delta: 167.8MB). Free memory was 57.3MB in the beginning and 134.1MB in the end (delta: -76.8MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 264.2MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (7 trivial, 6 deterministic, 3 nondeterministic). One deterministic module has affine ranking function -2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function -1 * j + n and consists of 7 locations. One deterministic module has affine ranking function -1 * i + 1 and consists of 8 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 10 locations. One deterministic module has affine ranking function -2 * i + 5 and consists of 17 locations. One deterministic module has affine ranking function 7 * n + -4 * i and consists of 5 locations. One nondeterministic module has affine ranking function -2 * j + 5 * i and consists of 6 locations. One nondeterministic module has affine ranking function -1 * j + 3 * i and consists of 4 locations. One nondeterministic module has affine ranking function j + -1 * k and consists of 4 locations. 7 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.1s and 12 iterations. TraceHistogramMax:7. Analysis of lassos took 12.7s. Construction of modules took 1.0s. Büchi inclusion checks took 7.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 14. Automata minimization 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 1227 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 485 states and ocurred in iteration 8. Nontrivial modules had stage [6, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 55/73 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 596 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 596 mSDsluCounter, 779 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 461 mSDsCounter, 236 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1106 IncrementalHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 236 mSolverCounterUnsat, 318 mSDtfsCounter, 1106 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT4 conc0 concLT4 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital40 mio100 ax100 hnf100 lsp91 ukn98 mio100 lsp100 div100 bol100 ite100 ukn100 eq144 hnf94 smp98 dnf130 smp96 tf104 neg97 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 0 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 16 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:00:04,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:05,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:05,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:05,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-02-21 04:00:05,809 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