./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/min_rf-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/min_rf-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 424cde395b70ff3d0446987dbcbb3aeecf97692a0011a6b2d4755a86aacf6e33 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:32:50,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:32:50,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:32:50,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:32:50,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:32:50,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:32:50,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:32:50,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:32:50,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:32:50,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:32:50,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:32:50,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:32:50,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:32:50,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:32:50,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:32:50,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:32:50,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:32:50,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:32:50,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:32:50,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:32:50,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:32:50,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:32:50,503 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:32:50,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:32:50,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:32:50,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:32:50,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:32:50,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:32:50,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:32:50,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:32:50,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:32:50,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:32:50,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:32:50,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:32:50,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:32:50,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:32:50,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:32:50,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:32:50,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:32:50,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:32:50,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:32:50,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:32:50,546 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:32:50,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:32:50,547 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:32:50,547 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:32:50,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:32:50,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:32:50,548 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:32:50,549 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:32:50,549 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:32:50,549 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:32:50,550 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:32:50,550 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:32:50,550 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:32:50,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:32:50,550 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:32:50,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:32:50,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:32:50,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:32:50,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:32:50,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:32:50,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:32:50,551 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:32:50,552 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:32:50,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:32:50,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:32:50,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:32:50,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:32:50,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:32:50,553 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:32:50,553 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 424cde395b70ff3d0446987dbcbb3aeecf97692a0011a6b2d4755a86aacf6e33 [2022-02-21 03:32:50,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:32:50,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:32:50,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:32:50,775 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:32:50,777 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:32:50,778 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/min_rf-alloca.i [2022-02-21 03:32:50,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f46fbec/dc0798d14bee40bab2fcb91291888e28/FLAG1bb3674b5 [2022-02-21 03:32:51,226 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:32:51,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/min_rf-alloca.i [2022-02-21 03:32:51,239 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f46fbec/dc0798d14bee40bab2fcb91291888e28/FLAG1bb3674b5 [2022-02-21 03:32:51,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f46fbec/dc0798d14bee40bab2fcb91291888e28 [2022-02-21 03:32:51,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:32:51,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:32:51,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:51,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:32:51,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:32:51,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:51" (1/1) ... [2022-02-21 03:32:51,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d031fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:51, skipping insertion in model container [2022-02-21 03:32:51,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:51" (1/1) ... [2022-02-21 03:32:51,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:32:51,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:32:51,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:51,533 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:32:51,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:51,594 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:32:51,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:51 WrapperNode [2022-02-21 03:32:51,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:51,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:51,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:32:51,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:32:51,600 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:32:51" (1/1) ... [2022-02-21 03:32:51,617 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:32:51" (1/1) ... [2022-02-21 03:32:51,641 INFO L137 Inliner]: procedures = 110, calls = 34, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 78 [2022-02-21 03:32:51,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:51,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:32:51,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:32:51,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:32:51,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:51" (1/1) ... [2022-02-21 03:32:51,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:51" (1/1) ... [2022-02-21 03:32:51,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:51" (1/1) ... [2022-02-21 03:32:51,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:51" (1/1) ... [2022-02-21 03:32:51,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:51" (1/1) ... [2022-02-21 03:32:51,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:51" (1/1) ... [2022-02-21 03:32:51,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:51" (1/1) ... [2022-02-21 03:32:51,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:32:51,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:32:51,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:32:51,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:32:51,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:51" (1/1) ... [2022-02-21 03:32:51,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:51,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:51,721 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:32:51,743 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:32:51,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:32:51,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:32:51,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:32:51,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:32:51,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:32:51,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:32:51,857 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:32:51,859 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:32:52,042 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:32:52,048 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:32:52,051 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:32:52,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:52 BoogieIcfgContainer [2022-02-21 03:32:52,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:32:52,053 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:32:52,054 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:32:52,056 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:32:52,057 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:52,057 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:32:51" (1/3) ... [2022-02-21 03:32:52,058 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e7b0ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:52, skipping insertion in model container [2022-02-21 03:32:52,058 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:52,058 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:51" (2/3) ... [2022-02-21 03:32:52,059 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e7b0ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:52, skipping insertion in model container [2022-02-21 03:32:52,059 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:52,059 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:52" (3/3) ... [2022-02-21 03:32:52,067 INFO L388 chiAutomizerObserver]: Analyzing ICFG min_rf-alloca.i [2022-02-21 03:32:52,119 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:32:52,119 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:32:52,119 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:32:52,119 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:32:52,120 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:32:52,120 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:32:52,120 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:32:52,120 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:32:52,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:52,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:52,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:52,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:52,163 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:52,163 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:32:52,164 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:32:52,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:52,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:52,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:52,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:52,170 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:32:52,171 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:32:52,176 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; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet6#1; 8#L556-1true [2022-02-21 03:32:52,177 INFO L793 eck$LassoCheckResult]: Loop: 8#L556-1true call main_#t~mem7#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 > 0; 11#L553-1true assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; 6#L553-3true assume !!main_#t~short9#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4); 13#L554true assume main_#t~mem10#1 > main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem12#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem12#1; 7#L554-2true assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem15#1 + main_#t~mem16#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem19#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem18#1 + main_#t~mem19#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem18#1;havoc main_#t~mem19#1; 8#L556-1true [2022-02-21 03:32:52,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:52,191 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:32:52,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:52,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629377827] [2022-02-21 03:32:52,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:52,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,362 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,409 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:52,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:52,411 INFO L85 PathProgramCache]: Analyzing trace with hash 35409684, now seen corresponding path program 1 times [2022-02-21 03:32:52,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:52,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419420062] [2022-02-21 03:32:52,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:52,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,487 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,513 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:52,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:52,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849170, now seen corresponding path program 1 times [2022-02-21 03:32:52,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:52,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133611892] [2022-02-21 03:32:52,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:52,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,569 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:52,589 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:53,291 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:53,292 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:53,292 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:53,292 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:53,292 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:53,292 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:53,292 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:53,293 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:53,293 INFO L133 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca.i_Iteration1_Lasso [2022-02-21 03:32:53,293 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:53,293 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:53,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:53,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 03:32:53,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 03:32:53,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 03:32:53,329 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:32:53,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 03:32:53,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 03:32:53,335 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:32:53,337 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:32:53,339 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:32:53,341 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:32:53,342 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:32:53,344 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:32:53,345 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:32:53,347 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:32:53,349 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:32:53,351 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:32:53,353 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:32:53,808 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:32:53,810 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:32:53,817 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:32:53,821 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:32:53,823 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:32:53,825 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:32:53,826 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:32:53,829 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:32:53,831 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:32:53,833 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:32:53,835 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:32:54,346 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:54,350 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:54,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,352 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:32:54,354 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:32:54,355 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:32:54,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:54,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,388 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:32:54,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,390 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:32:54,391 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:32:54,392 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:32:54,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:54,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,417 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:32:54,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,418 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:32:54,419 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:32:54,420 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:32:54,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:54,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:32:54,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,445 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:32:54,446 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:32:54,447 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:32:54,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:54,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:32:54,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,471 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:32:54,472 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:32:54,473 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:32:54,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:54,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,506 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:32:54,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,507 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:32:54,515 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:32:54,516 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:32:54,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:54,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:54,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:32:54,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,563 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:32:54,564 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:32:54,566 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:32:54,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:54,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,596 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:32:54,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,600 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:32:54,600 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:32:54,601 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:32:54,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,607 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:32:54,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,608 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:32:54,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:54,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,627 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:32:54,628 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:32:54,630 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:32:54,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:54,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,660 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:32:54,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,662 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:32:54,662 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:32:54,664 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:32:54,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:54,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:54,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,700 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:32:54,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,702 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:32:54,703 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:32:54,704 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:32:54,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:54,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:54,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,744 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:32:54,745 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:32:54,746 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:32:54,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:54,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,769 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:32:54,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,770 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:32:54,771 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:32:54,772 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:32:54,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:54,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,807 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:32:54,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,808 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:32:54,809 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:32:54,810 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:32:54,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:54,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:54,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:54,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,845 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:32:54,846 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:32:54,847 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:32:54,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:54,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,869 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 03:32:54,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,886 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:32:54,887 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:32:54,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:54,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:54,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:54,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,912 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:32:54,913 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:32:54,914 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:32:54,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:54,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:54,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,948 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:32:54,948 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:32:54,950 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:32:54,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:54,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:54,972 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:54,983 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:32:54,983 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-02-21 03:32:54,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,985 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:32:54,990 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:54,992 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:32:55,016 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:55,017 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:55,017 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1 Supporting invariants [] [2022-02-21 03:32:55,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:55,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:55,203 INFO L297 tatePredicateManager]: 20 out of 24 supporting invariants were superfluous and have been removed [2022-02-21 03:32:55,214 INFO L390 LassoCheck]: Loop: "call main_#t~mem7#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 > 0;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0;" "assume !!main_#t~short9#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);" "assume main_#t~mem10#1 > main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem12#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem12#1;" "assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem15#1 + main_#t~mem16#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem19#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem18#1 + main_#t~mem19#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem18#1;havoc main_#t~mem19#1;" [2022-02-21 03:32:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:55,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:55,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 03:32:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:55,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:55,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2022-02-21 03:32:55,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet6#1; {158#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:32:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:55,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 03:32:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:55,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:55,677 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-21 03:32:55,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2022-02-21 03:32:55,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem7#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 > 0; {170#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))} is VALID [2022-02-21 03:32:55,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {174#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))} is VALID [2022-02-21 03:32:55,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {174#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))} assume !!main_#t~short9#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4); {178#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|))} is VALID [2022-02-21 03:32:55,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {178#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|))} assume main_#t~mem10#1 > main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem12#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem12#1; {182#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (< (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:32:55,733 INFO L290 TraceCheckUtils]: 4: Hoare triple {182#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (< (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem15#1 + main_#t~mem16#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem19#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem18#1 + main_#t~mem19#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem18#1;havoc main_#t~mem19#1; {161#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:32:55,734 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:32:55,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 5 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:55,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:55,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,790 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-02-21 03:32:55,791 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,942 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 40 transitions. Complement of second has 12 states. [2022-02-21 03:32:55,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:55,942 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:55,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:55,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:55,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:55,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:55,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:55,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:55,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:32:55,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:55,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:55,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:55,955 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:55,958 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:32:55,958 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:55,966 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:55,966 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 40 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:55,969 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:32:55,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:55,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:55,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:55,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:55,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:55,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:55,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:55,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:55,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:55,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 03:32:55,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:32:55,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:32:55,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 11 letters. [2022-02-21 03:32:55,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:55,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:55,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:32:55,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:32:55,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:32:55,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:55,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:55,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:55,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:55,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:55,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:55,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:55,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:32:55,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:32:55,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:32:55,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:55,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:55,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:55,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:32:55,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:32:55,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:55,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:55,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:55,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:55,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:55,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:55,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:55,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:32:55,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:32:55,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:55,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:32:55,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:32:55,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:55,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:32:55,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:32:55,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:55,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:32:55,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:32:55,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,987 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:55,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-02-21 03:32:55,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:55,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,992 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:56,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:56,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 03:32:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:56,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:56,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2022-02-21 03:32:56,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet6#1; {158#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:32:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:56,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 03:32:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:56,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:56,406 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-21 03:32:56,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2022-02-21 03:32:56,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem7#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 > 0; {242#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))} is VALID [2022-02-21 03:32:56,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {246#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))} is VALID [2022-02-21 03:32:56,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))} assume !!main_#t~short9#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4); {250#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|))} is VALID [2022-02-21 03:32:56,469 INFO L290 TraceCheckUtils]: 3: Hoare triple {250#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|))} assume main_#t~mem10#1 > main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem12#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem12#1; {254#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (< (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:32:56,471 INFO L290 TraceCheckUtils]: 4: Hoare triple {254#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (< (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem15#1 + main_#t~mem16#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem19#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem18#1 + main_#t~mem19#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem18#1;havoc main_#t~mem19#1; {161#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:32:56,471 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:32:56,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:56,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 5 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:56,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:56,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,481 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2022-02-21 03:32:56,481 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:56,602 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 40 transitions. Complement of second has 12 states. [2022-02-21 03:32:56,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:56,602 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:56,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:56,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:56,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:56,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:56,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:56,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:56,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:56,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:56,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:32:56,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:56,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:56,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:56,604 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:56,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:56,605 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:32:56,605 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:56,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:56,606 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:56,606 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 40 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:56,607 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:32:56,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:56,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:56,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:56,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:56,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:56,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:56,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:56,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:56,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:56,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 03:32:56,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:32:56,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:32:56,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 11 letters. [2022-02-21 03:32:56,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:56,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:56,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:32:56,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:32:56,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:32:56,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:56,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:56,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:56,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:56,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:56,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:56,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:56,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:32:56,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:32:56,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:32:56,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:56,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:56,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:56,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:32:56,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:32:56,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:56,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:56,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:56,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:56,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:32:56,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:32:56,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:56,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:32:56,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:32:56,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:56,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:56,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:56,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:56,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:32:56,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:32:56,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:56,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:32:56,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:32:56,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,618 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-02-21 03:32:56,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:56,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:56,620 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:56,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:56,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 03:32:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:56,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:56,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2022-02-21 03:32:56,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet6#1; {158#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:32:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:56,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 03:32:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:56,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:57,014 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-21 03:32:57,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2022-02-21 03:32:57,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem7#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 > 0; {314#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))} is VALID [2022-02-21 03:32:57,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {318#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))} is VALID [2022-02-21 03:32:57,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {318#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))} assume !!main_#t~short9#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4); {322#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|))} is VALID [2022-02-21 03:32:57,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {322#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|))} assume main_#t~mem10#1 > main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem12#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem12#1; {326#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (< (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:32:57,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {326#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (< (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem15#1 + main_#t~mem16#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem19#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem18#1 + main_#t~mem19#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem18#1;havoc main_#t~mem19#1; {161#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:32:57,085 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:32:57,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:57,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 5 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:57,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:57,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,094 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 5 loop predicates [2022-02-21 03:32:57,094 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:57,239 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 41 transitions. Complement of second has 11 states. [2022-02-21 03:32:57,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:57,239 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:57,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:57,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:57,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:57,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:57,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:57,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:57,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:57,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:57,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2022-02-21 03:32:57,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:57,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:57,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:57,243 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:57,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:57,243 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:32:57,244 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:57,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:57,245 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:57,245 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 41 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:57,245 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:32:57,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:57,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:57,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:57,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:57,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:57,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:57,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:57,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:57,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:32:57,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:32:57,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:32:57,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 11 letters. [2022-02-21 03:32:57,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:57,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:57,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:32:57,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:32:57,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:32:57,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:57,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:57,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:57,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:57,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:57,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:32:57,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:32:57,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:32:57,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:57,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:57,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:32:57,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:32:57,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:57,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:57,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:57,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:57,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:57,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:32:57,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:32:57,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:32:57,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:32:57,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:32:57,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:32:57,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:32:57,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:32:57,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,257 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-02-21 03:32:57,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:57,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,259 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:57,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:57,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 03:32:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:57,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:57,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2022-02-21 03:32:57,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet6#1; {158#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:32:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:57,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 03:32:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:57,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:57,676 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-21 03:32:57,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2022-02-21 03:32:57,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem7#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 > 0; {386#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))} is VALID [2022-02-21 03:32:57,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {390#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))} is VALID [2022-02-21 03:32:57,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))} assume !!main_#t~short9#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4); {394#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|))} is VALID [2022-02-21 03:32:57,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {394#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|))} assume main_#t~mem10#1 > main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem12#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem12#1; {398#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (< (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:32:57,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {398#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (< (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem15#1 + main_#t~mem16#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem19#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem18#1 + main_#t~mem19#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem18#1;havoc main_#t~mem19#1; {161#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:32:57,754 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:32:57,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:57,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 5 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:57,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:57,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,763 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2022-02-21 03:32:57,764 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:57,892 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 41 transitions. Complement of second has 11 states. [2022-02-21 03:32:57,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:57,892 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:57,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:57,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:57,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:57,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:57,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:57,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:57,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:57,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:57,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2022-02-21 03:32:57,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:57,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:57,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:57,894 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:57,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:57,895 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:32:57,895 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:57,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:57,895 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:57,897 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 41 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:57,897 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:32:57,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:57,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:57,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:57,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:57,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:57,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:57,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:57,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:57,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:32:57,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:32:57,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:32:57,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 11 letters. [2022-02-21 03:32:57,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:57,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:57,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:32:57,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:32:57,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:32:57,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:57,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:57,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:57,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:57,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:57,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:32:57,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:32:57,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:32:57,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:57,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:57,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:32:57,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:32:57,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:57,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:57,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:57,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:32:57,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:32:57,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:57,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:57,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:32:57,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:32:57,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:32:57,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:32:57,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:57,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:32:57,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:32:57,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,905 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-02-21 03:32:57,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:57,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:57,909 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:57,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:57,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 03:32:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:57,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:57,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2022-02-21 03:32:57,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet6#1; {158#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:32:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:57,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 03:32:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:57,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:58,337 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-21 03:32:58,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2022-02-21 03:32:58,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem7#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 > 0; {458#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))} is VALID [2022-02-21 03:32:58,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {462#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))} is VALID [2022-02-21 03:32:58,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {462#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))} assume !!main_#t~short9#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4); {466#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|))} is VALID [2022-02-21 03:32:58,407 INFO L290 TraceCheckUtils]: 3: Hoare triple {466#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|))} assume main_#t~mem10#1 > main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem12#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem12#1; {470#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (< (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:32:58,408 INFO L290 TraceCheckUtils]: 4: Hoare triple {470#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (< (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~z~0#1.base|) |ULTIMATE.start_main_~z~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem15#1 + main_#t~mem16#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem19#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem18#1 + main_#t~mem19#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem18#1;havoc main_#t~mem19#1; {161#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:32:58,408 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:32:58,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:58,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 5 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:58,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:58,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,419 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-02-21 03:32:58,419 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:58,638 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 78 states and 125 transitions. Complement of second has 26 states 9 powerset states17 rank states. The highest rank that occured is 3 [2022-02-21 03:32:58,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 4 non-accepting loop states 2 accepting loop states [2022-02-21 03:32:58,638 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceFKV [2022-02-21 03:32:58,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:58,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:58,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:58,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:58,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:58,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:58,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:58,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:58,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 125 transitions. [2022-02-21 03:32:58,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 03:32:58,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:58,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:58,641 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:58,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:32:58,641 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:32:58,641 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:58,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:32:58,642 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:58,643 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 78 states and 125 transitions. cyclomatic complexity: 49 [2022-02-21 03:32:58,643 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:32:58,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:58,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:58,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:58,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:58,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:58,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:58,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 10 letters. [2022-02-21 03:32:58,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 10 letters. [2022-02-21 03:32:58,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 7 letters. Loop has 10 letters. [2022-02-21 03:32:58,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 78 letters. [2022-02-21 03:32:58,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 78 letters. [2022-02-21 03:32:58,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 78 letters. Loop has 78 letters. [2022-02-21 03:32:58,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 11 letters. [2022-02-21 03:32:58,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:58,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:32:58,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:32:58,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:32:58,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:32:58,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:58,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:58,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:58,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:58,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:58,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:32:58,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:58,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:32:58,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:32:58,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:32:58,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:58,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:58,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 5 letters. [2022-02-21 03:32:58,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:32:58,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:32:58,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:58,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:58,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:32:58,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:32:58,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:32:58,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:32:58,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 10 letters. [2022-02-21 03:32:58,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 10 letters. [2022-02-21 03:32:58,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 8 letters. Loop has 10 letters. [2022-02-21 03:32:58,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:32:58,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:32:58,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:32:58,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 10 letters. [2022-02-21 03:32:58,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 10 letters. [2022-02-21 03:32:58,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 9 letters. Loop has 10 letters. [2022-02-21 03:32:58,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 10 letters. [2022-02-21 03:32:58,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 10 letters. [2022-02-21 03:32:58,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 125 transitions. cyclomatic complexity: 49 Stem has 7 letters. Loop has 10 letters. [2022-02-21 03:32:58,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,656 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceFKV [2022-02-21 03:32:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-02-21 03:32:58,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:32:58,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:58,657 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:58,658 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: no settings was sufficient at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:32:58,661 INFO L158 Benchmark]: Toolchain (without parser) took 7410.08ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 48.5MB in the beginning and 72.1MB in the end (delta: -23.6MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2022-02-21 03:32:58,661 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 88.1MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:58,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.80ms. Allocated memory is still 88.1MB. Free memory was 48.3MB in the beginning and 56.3MB in the end (delta: -7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:32:58,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.97ms. Allocated memory is still 88.1MB. Free memory was 56.0MB in the beginning and 54.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:58,662 INFO L158 Benchmark]: Boogie Preprocessor took 33.80ms. Allocated memory is still 88.1MB. Free memory was 54.2MB in the beginning and 52.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:58,662 INFO L158 Benchmark]: RCFGBuilder took 375.82ms. Allocated memory is still 88.1MB. Free memory was 52.6MB in the beginning and 36.7MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 03:32:58,663 INFO L158 Benchmark]: BuchiAutomizer took 6606.44ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 36.4MB in the beginning and 72.1MB in the end (delta: -35.7MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2022-02-21 03:32:58,664 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.12ms. Allocated memory is still 88.1MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.80ms. Allocated memory is still 88.1MB. Free memory was 48.3MB in the beginning and 56.3MB in the end (delta: -7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.97ms. Allocated memory is still 88.1MB. Free memory was 56.0MB in the beginning and 54.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.80ms. Allocated memory is still 88.1MB. Free memory was 54.2MB in the beginning and 52.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 375.82ms. Allocated memory is still 88.1MB. Free memory was 52.6MB in the beginning and 36.7MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 6606.44ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 36.4MB in the beginning and 72.1MB in the end (delta: -35.7MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: no settings was sufficient de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: no settings was sufficient: de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:32:58,698 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no settings was sufficient