./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/Ackermann01-1.c --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-numeric/Ackermann01-1.c -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 380ed529f726f53285b49ce40e57404dbe066b029b8c3af7ce337366515780a5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:25:27,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:25:27,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:25:27,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:25:27,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:25:27,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:25:27,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:25:27,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:25:27,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:25:27,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:25:27,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:25:27,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:25:27,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:25:27,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:25:27,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:25:27,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:25:27,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:25:27,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:25:27,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:25:27,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:25:27,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:25:27,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:25:27,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:25:27,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:25:27,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:25:27,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:25:27,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:25:27,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:25:27,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:25:27,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:25:27,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:25:27,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:25:27,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:25:27,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:25:27,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:25:27,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:25:27,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:25:27,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:25:27,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:25:27,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:25:27,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:25:27,975 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:25:28,003 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:25:28,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:25:28,003 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:25:28,004 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:25:28,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:25:28,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:25:28,006 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:25:28,006 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:25:28,006 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:25:28,006 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:25:28,007 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:25:28,007 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:25:28,007 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:25:28,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:25:28,008 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:25:28,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:25:28,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:25:28,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:25:28,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:25:28,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:25:28,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:25:28,009 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:25:28,009 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:25:28,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:25:28,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:25:28,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:25:28,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:25:28,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:25:28,011 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:25:28,011 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 -> 380ed529f726f53285b49ce40e57404dbe066b029b8c3af7ce337366515780a5 [2022-02-21 03:25:28,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:25:28,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:25:28,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:25:28,253 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:25:28,254 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:25:28,255 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Ackermann01-1.c [2022-02-21 03:25:28,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c4a0153/66cf083f5d774e7b89ea39c5728d36e3/FLAGd01be3eee [2022-02-21 03:25:28,701 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:25:28,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Ackermann01-1.c [2022-02-21 03:25:28,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c4a0153/66cf083f5d774e7b89ea39c5728d36e3/FLAGd01be3eee [2022-02-21 03:25:28,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c4a0153/66cf083f5d774e7b89ea39c5728d36e3 [2022-02-21 03:25:28,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:25:28,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:25:28,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:25:28,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:25:28,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:25:28,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:25:28" (1/1) ... [2022-02-21 03:25:28,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ccba55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:28, skipping insertion in model container [2022-02-21 03:25:28,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:25:28" (1/1) ... [2022-02-21 03:25:28,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:25:28,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:25:28,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Ackermann01-1.c[944,957] [2022-02-21 03:25:28,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:25:28,926 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:25:28,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Ackermann01-1.c[944,957] [2022-02-21 03:25:28,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:25:28,963 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:25:28,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:28 WrapperNode [2022-02-21 03:25:28,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:25:28,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:25:28,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:25:28,966 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:25:28,973 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:25:28" (1/1) ... [2022-02-21 03:25:28,981 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:25:28" (1/1) ... [2022-02-21 03:25:29,003 INFO L137 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2022-02-21 03:25:29,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:25:29,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:25:29,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:25:29,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:25:29,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:28" (1/1) ... [2022-02-21 03:25:29,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:28" (1/1) ... [2022-02-21 03:25:29,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:28" (1/1) ... [2022-02-21 03:25:29,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:28" (1/1) ... [2022-02-21 03:25:29,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:28" (1/1) ... [2022-02-21 03:25:29,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:28" (1/1) ... [2022-02-21 03:25:29,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:28" (1/1) ... [2022-02-21 03:25:29,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:25:29,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:25:29,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:25:29,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:25:29,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:28" (1/1) ... [2022-02-21 03:25:29,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:29,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:29,060 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:25:29,061 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:25:29,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:25:29,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:25:29,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:25:29,099 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2022-02-21 03:25:29,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2022-02-21 03:25:29,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:25:29,149 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:25:29,150 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:25:29,289 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:25:29,294 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:25:29,294 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:25:29,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:29 BoogieIcfgContainer [2022-02-21 03:25:29,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:25:29,297 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:25:29,297 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:25:29,304 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:25:29,306 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:29,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:25:28" (1/3) ... [2022-02-21 03:25:29,308 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@234058fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:25:29, skipping insertion in model container [2022-02-21 03:25:29,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:29,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:28" (2/3) ... [2022-02-21 03:25:29,309 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@234058fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:25:29, skipping insertion in model container [2022-02-21 03:25:29,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:29,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:29" (3/3) ... [2022-02-21 03:25:29,323 INFO L388 chiAutomizerObserver]: Analyzing ICFG Ackermann01-1.c [2022-02-21 03:25:29,380 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:25:29,381 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:25:29,381 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:25:29,381 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:25:29,381 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:25:29,382 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:25:29,382 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:25:29,382 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:25:29,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:25:29,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:29,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:29,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:29,448 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:25:29,448 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:25:29,448 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:25:29,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:25:29,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:29,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:29,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:29,463 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:25:29,464 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:25:29,470 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 8#L29true assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 9#L33true assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 11#L36true call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 6#ackermannENTRYtrue [2022-02-21 03:25:29,471 INFO L793 eck$LassoCheckResult]: Loop: 6#ackermannENTRYtrue ~m := #in~m;~n := #in~n; 14#L17true assume !(0 == ~m); 15#L20true assume 0 == ~n; 17#L21true call #t~ret4 := ackermann(~m - 1, 1);< 6#ackermannENTRYtrue [2022-02-21 03:25:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:29,478 INFO L85 PathProgramCache]: Analyzing trace with hash 28695872, now seen corresponding path program 1 times [2022-02-21 03:25:29,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:29,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564809525] [2022-02-21 03:25:29,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:29,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:29,599 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:29,628 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:29,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:29,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1697199, now seen corresponding path program 1 times [2022-02-21 03:25:29,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:29,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619415356] [2022-02-21 03:25:29,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:29,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:29,654 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:29,670 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:29,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:29,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1292962670, now seen corresponding path program 1 times [2022-02-21 03:25:29,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:29,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308023996] [2022-02-21 03:25:29,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:29,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:29,710 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:29,740 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:30,021 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:30,021 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:30,022 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:30,022 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:30,022 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:30,022 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:30,023 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:30,023 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:30,023 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration1_Loop [2022-02-21 03:25:30,023 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:30,024 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:30,035 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:25:30,041 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:25:30,045 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:25:30,047 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:25:30,050 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:25:30,053 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:25:30,056 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:25:30,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:30,180 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:30,181 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:30,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:30,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:30,188 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:25:30,190 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:25:30,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:30,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:30,206 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:30,206 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:30,224 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:25:30,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:30,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:30,226 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:25:30,229 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:25:30,230 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:30,230 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:30,237 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:30,237 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:30,254 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:25:30,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:30,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:30,256 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:25:30,257 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:25:30,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:30,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:30,265 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:30,266 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:30,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:30,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:30,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:30,282 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:25:30,283 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:25:30,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:30,286 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:30,292 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:30,292 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:30,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:30,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:30,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:30,310 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:25:30,310 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:25:30,313 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:30,313 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:30,323 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:30,323 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:30,347 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:25:30,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:30,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:30,349 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:25:30,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:30,355 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:30,363 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:25:30,375 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:30,376 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:30,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:30,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:30,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:30,406 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:25:30,408 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:25:30,409 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:30,409 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:30,446 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:25:30,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:30,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:30,448 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:25:30,450 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:25:30,453 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:30,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:30,471 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:30,496 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:25:30,496 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:30,496 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:30,496 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:30,496 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:30,496 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:30,497 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:30,497 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:30,497 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:30,497 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration1_Loop [2022-02-21 03:25:30,497 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:30,497 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:30,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:30,505 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:25:30,511 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:25:30,514 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:25:30,516 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:25:30,522 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:25:30,525 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:25:30,528 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:25:30,646 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:30,650 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:30,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:30,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:30,652 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:25:30,653 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:25:30,655 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:25:30,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:30,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:30,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:30,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:30,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:30,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:30,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:30,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:30,702 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:25:30,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:30,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:30,703 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:25:30,712 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:25:30,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:30,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:30,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:30,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:30,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:30,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:30,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:30,723 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:25:30,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:30,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 03:25:30,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:30,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:30,751 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:25:30,759 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:25:30,760 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:25:30,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:30,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:30,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:30,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:30,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:30,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:30,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:30,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:30,791 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:25:30,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:30,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:30,792 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:25:30,793 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:25:30,794 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:25:30,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:30,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:30,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:30,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:30,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:30,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:30,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:30,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:30,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 03:25:30,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:30,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:30,824 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:25:30,825 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:25:30,828 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:25:30,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:30,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:30,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:30,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:30,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:30,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:30,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:30,863 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:30,868 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:30,868 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:25:30,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:30,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:30,875 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:25:30,882 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:30,882 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:30,882 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:30,883 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:25:30,883 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~n) = -2*ackermann_#in~n + 1 Supporting invariants [] [2022-02-21 03:25:30,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:30,926 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:30,930 INFO L390 LassoCheck]: Loop: "~m := #in~m;~n := #in~n;" "assume !(0 == ~m);" "assume 0 == ~n;" "call #t~ret4 := ackermann(~m - 1, 1);"< [2022-02-21 03:25:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:30,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:30,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:30,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:31,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {31#unseeded} is VALID [2022-02-21 03:25:31,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {31#unseeded} is VALID [2022-02-21 03:25:31,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {31#unseeded} is VALID [2022-02-21 03:25:31,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#unseeded} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {31#unseeded} is VALID [2022-02-21 03:25:31,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#unseeded} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {31#unseeded} is VALID [2022-02-21 03:25:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:31,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:25:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:31,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:31,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(>= oldRank0 (+ (* (- 2) |ackermann_#in~n|) 1))} ~m := #in~m;~n := #in~n; {61#(<= (+ (div (- oldRank0) 2) 1) ackermann_~n)} is VALID [2022-02-21 03:25:31,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#(<= (+ (div (- oldRank0) 2) 1) ackermann_~n)} assume !(0 == ~m); {61#(<= (+ (div (- oldRank0) 2) 1) ackermann_~n)} is VALID [2022-02-21 03:25:31,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {61#(<= (+ (div (- oldRank0) 2) 1) ackermann_~n)} assume 0 == ~n; {68#(<= (+ (div (* (- 1) oldRank0) 2) 1) 0)} is VALID [2022-02-21 03:25:31,183 INFO L272 TraceCheckUtils]: 3: Hoare triple {68#(<= (+ (div (* (- 1) oldRank0) 2) 1) 0)} call #t~ret4 := ackermann(~m - 1, 1); {44#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ackermann_#in~n|) 1))))} is VALID [2022-02-21 03:25:31,184 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:25:31,188 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:25:31,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:31,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:31,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:25:31,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,231 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:25:31,232 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:31,434 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4). Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 50 states and 65 transitions. Complement of second has 12 states. [2022-02-21 03:25:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:31,434 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:31,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:25:31,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:31,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:31,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:31,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:31,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:31,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:31,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:31,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 65 transitions. [2022-02-21 03:25:31,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:31,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:31,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:31,445 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:25:31,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:31,450 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:25:31,450 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:31,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:31,452 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:31,452 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 65 transitions. cyclomatic complexity: 17 [2022-02-21 03:25:31,457 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:25:31,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:25:31,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:25:31,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:25:31,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:31,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:31,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:31,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:31,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:31,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:31,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 50 letters. Loop has 50 letters. [2022-02-21 03:25:31,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 50 letters. [2022-02-21 03:25:31,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 50 letters. Loop has 50 letters. [2022-02-21 03:25:31,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:25:31,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:25:31,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:25:31,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:31,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:31,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:31,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:31,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:31,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:31,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:31,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:31,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:31,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:25:31,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:25:31,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:25:31,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:31,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:31,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:31,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:25:31,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:25:31,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:25:31,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:25:31,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:25:31,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:25:31,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:31,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:31,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:31,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:31,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:31,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:31,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:25:31,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:25:31,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:25:31,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:31,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:31,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:31,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:31,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:31,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:31,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:31,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:31,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:31,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:25:31,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:25:31,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:25:31,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:31,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:31,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:31,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:31,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:31,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:31,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,487 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 03:25:31,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:25:31,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:31,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:25:31,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:31,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. cyclomatic complexity: 17 [2022-02-21 03:25:31,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:31,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 29 states and 37 transitions. [2022-02-21 03:25:31,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-02-21 03:25:31,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-02-21 03:25:31,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-02-21 03:25:31,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:31,508 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-02-21 03:25:31,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-02-21 03:25:31,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2022-02-21 03:25:31,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:31,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states and 37 transitions. Second operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:25:31,531 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states and 37 transitions. Second operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:25:31,533 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:25:31,536 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:31,542 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-02-21 03:25:31,543 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2022-02-21 03:25:31,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:31,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:31,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states and 37 transitions. [2022-02-21 03:25:31,551 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states and 37 transitions. [2022-02-21 03:25:31,551 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:31,560 INFO L93 Difference]: Finished difference Result 88 states and 114 transitions. [2022-02-21 03:25:31,563 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2022-02-21 03:25:31,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:31,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:31,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:31,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:25:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-02-21 03:25:31,577 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-21 03:25:31,577 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-21 03:25:31,577 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:25:31,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2022-02-21 03:25:31,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:31,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:31,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:31,578 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:31,578 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:25:31,578 INFO L791 eck$LassoCheckResult]: Stem: 139#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 140#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 152#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 153#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 142#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 141#ackermannENTRY ~m := #in~m;~n := #in~n; 144#L17 assume !(0 == ~m); 157#L20 assume !(0 == ~n); 148#L23 [2022-02-21 03:25:31,578 INFO L793 eck$LassoCheckResult]: Loop: 148#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 156#ackermannENTRY ~m := #in~m;~n := #in~n; 159#L17 assume !(0 == ~m); 160#L20 assume !(0 == ~n); 148#L23 [2022-02-21 03:25:31,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:31,579 INFO L85 PathProgramCache]: Analyzing trace with hash 180255807, now seen corresponding path program 1 times [2022-02-21 03:25:31,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:31,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640847223] [2022-02-21 03:25:31,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:31,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:31,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:31,598 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:31,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:31,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2259284, now seen corresponding path program 1 times [2022-02-21 03:25:31,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:31,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052526857] [2022-02-21 03:25:31,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:31,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:31,604 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:31,607 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:31,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:31,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1387046546, now seen corresponding path program 1 times [2022-02-21 03:25:31,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:31,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812912515] [2022-02-21 03:25:31,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:31,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:31,620 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:31,632 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:31,739 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:31,739 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:31,739 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:31,739 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:31,739 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:31,739 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:31,739 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:31,739 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:31,740 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration2_Loop [2022-02-21 03:25:31,740 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:31,740 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:31,741 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:25:31,743 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:25:31,745 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:25:31,747 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:25:31,752 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:25:31,758 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:25:31,863 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:31,864 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:31,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:31,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:31,865 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:25:31,867 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:25:31,874 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:31,876 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:31,892 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:31,892 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:31,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:31,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:31,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:31,909 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:25:31,910 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:25:31,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:31,912 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:31,918 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:31,918 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:31,935 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:25:31,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:31,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:31,937 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:25:31,939 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:25:31,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:31,942 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:31,948 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:31,948 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:31,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 03:25:31,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:31,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:31,964 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:25:31,966 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:25:31,967 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:31,967 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:31,980 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:31,980 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=7, ackermann_~m=7} Honda state: {ackermann_#in~m=7, ackermann_~m=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:31,994 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:25:31,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:31,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:31,996 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:25:31,999 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:25:31,999 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:31,999 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:32,027 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:25:32,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:32,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:32,028 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:32,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:25:32,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:32,030 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:34,488 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:34,488 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=-1, ackermann_#in~n=1} Honda state: {ackermann_~n=-1, ackermann_#in~n=1} Generalized eigenvectors: [{ackermann_~n=-1, ackermann_#in~n=7}, {ackermann_~n=0, ackermann_#in~n=-8}, {ackermann_~n=0, ackermann_#in~n=-2}] Lambdas: [1, 0, 0] Nus: [1, 0] [2022-02-21 03:25:34,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:34,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:34,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:34,508 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:34,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:25:34,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:34,510 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:34,517 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:34,517 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:34,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:25:35,007 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:35,007 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:35,007 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:35,007 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:35,007 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:35,007 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:35,008 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:35,008 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:35,008 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration2_Lasso [2022-02-21 03:25:35,008 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:35,008 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:35,010 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:25:35,012 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:25:35,014 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:25:35,025 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:25:35,036 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:25:35,038 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:25:35,040 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:25:35,051 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:25:35,066 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:25:35,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:35,071 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:25:35,073 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:25:35,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:35,076 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:25:35,078 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:25:35,080 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:25:35,082 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:25:35,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:35,086 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:25:35,089 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:25:35,091 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:25:35,102 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:25:35,465 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:35,466 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:35,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:35,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:35,472 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:35,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:25:35,475 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:25:35,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:35,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:35,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:35,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:35,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:35,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:35,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:35,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:35,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:25:35,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:35,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:35,512 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:35,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:25:35,514 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:25:35,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:35,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:35,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:35,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:35,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:35,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:35,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:35,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:35,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:25:35,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:35,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:35,541 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:35,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:25:35,544 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:25:35,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:35,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:35,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:35,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:35,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:35,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:35,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:35,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:25:35,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:35,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:35,593 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:35,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:25:35,595 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:25:35,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:35,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:35,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:35,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:35,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:35,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:35,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:35,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:35,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:35,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:35,631 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:35,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:25:35,634 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:25:35,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:35,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:35,640 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:25:35,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:35,653 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 03:25:35,654 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:25:35,675 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:35,687 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:25:35,687 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-02-21 03:25:35,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:35,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:35,692 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:35,699 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:35,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:25:35,712 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-02-21 03:25:35,713 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:35,713 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~n) = 1*ackermann_~n Supporting invariants [2*ackermann_~n - 1 >= 0] [2022-02-21 03:25:35,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:35,752 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2022-02-21 03:25:35,760 INFO L390 LassoCheck]: Loop: "call #t~ret5 := ackermann(~m, ~n - 1);"< "~m := #in~m;~n := #in~n;" "assume !(0 == ~m);" "assume !(0 == ~n);" [2022-02-21 03:25:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:35,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:35,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:25:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:35,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:35,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {466#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {466#unseeded} is VALID [2022-02-21 03:25:35,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {466#unseeded} is VALID [2022-02-21 03:25:35,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {466#unseeded} is VALID [2022-02-21 03:25:35,895 INFO L290 TraceCheckUtils]: 3: Hoare triple {466#unseeded} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {508#(and unseeded (not (< |ULTIMATE.start_main_~n~0#1| 0)))} is VALID [2022-02-21 03:25:35,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {508#(and unseeded (not (< |ULTIMATE.start_main_~n~0#1| 0)))} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {512#(and (<= 0 |ackermann_#in~n|) unseeded)} is VALID [2022-02-21 03:25:35,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#(and (<= 0 |ackermann_#in~n|) unseeded)} ~m := #in~m;~n := #in~n; {516#(and (<= 0 ackermann_~n) unseeded)} is VALID [2022-02-21 03:25:35,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {516#(and (<= 0 ackermann_~n) unseeded)} assume !(0 == ~m); {516#(and (<= 0 ackermann_~n) unseeded)} is VALID [2022-02-21 03:25:35,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {516#(and (<= 0 ackermann_~n) unseeded)} assume !(0 == ~n); {490#(and (>= (+ (- 1) (* 2 ackermann_~n)) 0) unseeded)} is VALID [2022-02-21 03:25:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:35,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:35,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:36,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {491#(and (>= (+ (- 1) (* 2 ackermann_~n)) 0) (>= oldRank0 ackermann_~n))} call #t~ret5 := ackermann(~m, ~n - 1); {523#(and (<= (+ |ackermann_#in~n| 1) oldRank0) (<= 0 (+ (* |ackermann_#in~n| 2) 1)))} is VALID [2022-02-21 03:25:36,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {523#(and (<= (+ |ackermann_#in~n| 1) oldRank0) (<= 0 (+ (* |ackermann_#in~n| 2) 1)))} ~m := #in~m;~n := #in~n; {527#(and (<= 0 (+ (* ackermann_~n 2) 1)) (<= (+ ackermann_~n 1) oldRank0))} is VALID [2022-02-21 03:25:36,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#(and (<= 0 (+ (* ackermann_~n 2) 1)) (<= (+ ackermann_~n 1) oldRank0))} assume !(0 == ~m); {527#(and (<= 0 (+ (* ackermann_~n 2) 1)) (<= (+ ackermann_~n 1) oldRank0))} is VALID [2022-02-21 03:25:36,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {527#(and (<= 0 (+ (* ackermann_~n 2) 1)) (<= (+ ackermann_~n 1) oldRank0))} assume !(0 == ~n); {493#(and (>= (+ (- 1) (* 2 ackermann_~n)) 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 ackermann_~n))))} is VALID [2022-02-21 03:25:36,009 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:25:36,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:36,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:36,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:36,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,024 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2022-02-21 03:25:36,024 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8 Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:36,129 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 45 transitions. Complement of second has 12 states. [2022-02-21 03:25:36,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2022-02-21 03:25:36,130 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:36,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:36,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:36,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:36,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:36,131 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:36,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:36,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2022-02-21 03:25:36,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:36,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:36,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:36,132 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 28 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:36,134 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:25:36,134 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:36,134 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:36,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 12 transitions. cyclomatic complexity: 7 [2022-02-21 03:25:36,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:36,135 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:25:36,135 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 45 transitions. cyclomatic complexity: 13 [2022-02-21 03:25:36,136 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:25:36,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:36,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:36,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:36,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:36,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:36,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:36,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:25:36,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:25:36,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:25:36,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:25:36,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:25:36,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:25:36,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:25:36,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 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:25:36,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:25:36,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:25:36,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:25:36,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:25:36,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:36,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:36,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:36,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:36,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:36,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:36,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:36,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:36,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:36,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:25:36,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:25:36,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:25:36,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:36,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:36,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:36,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:36,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:36,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:36,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:25:36,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:36,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:25:36,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:25:36,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:36,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:36,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:36,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:36,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:36,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:36,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 45 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,178 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:36,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2022-02-21 03:25:36,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:36,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,180 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:36,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:36,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:25:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:36,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:36,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {466#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {466#unseeded} is VALID [2022-02-21 03:25:36,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {466#unseeded} is VALID [2022-02-21 03:25:36,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {466#unseeded} is VALID [2022-02-21 03:25:36,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {466#unseeded} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {605#(and unseeded (not (< |ULTIMATE.start_main_~n~0#1| 0)))} is VALID [2022-02-21 03:25:36,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#(and unseeded (not (< |ULTIMATE.start_main_~n~0#1| 0)))} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {609#(and (<= 0 |ackermann_#in~n|) unseeded)} is VALID [2022-02-21 03:25:36,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {609#(and (<= 0 |ackermann_#in~n|) unseeded)} ~m := #in~m;~n := #in~n; {613#(and (<= 0 ackermann_~n) unseeded)} is VALID [2022-02-21 03:25:36,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {613#(and (<= 0 ackermann_~n) unseeded)} assume !(0 == ~m); {613#(and (<= 0 ackermann_~n) unseeded)} is VALID [2022-02-21 03:25:36,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {613#(and (<= 0 ackermann_~n) unseeded)} assume !(0 == ~n); {490#(and (>= (+ (- 1) (* 2 ackermann_~n)) 0) unseeded)} is VALID [2022-02-21 03:25:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:36,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:36,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:36,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {491#(and (>= (+ (- 1) (* 2 ackermann_~n)) 0) (>= oldRank0 ackermann_~n))} call #t~ret5 := ackermann(~m, ~n - 1); {620#(and (<= (+ |ackermann_#in~n| 1) oldRank0) (<= 0 (+ (* |ackermann_#in~n| 2) 1)))} is VALID [2022-02-21 03:25:36,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {620#(and (<= (+ |ackermann_#in~n| 1) oldRank0) (<= 0 (+ (* |ackermann_#in~n| 2) 1)))} ~m := #in~m;~n := #in~n; {624#(and (<= 0 (+ (* ackermann_~n 2) 1)) (<= (+ ackermann_~n 1) oldRank0))} is VALID [2022-02-21 03:25:36,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {624#(and (<= 0 (+ (* ackermann_~n 2) 1)) (<= (+ ackermann_~n 1) oldRank0))} assume !(0 == ~m); {624#(and (<= 0 (+ (* ackermann_~n 2) 1)) (<= (+ ackermann_~n 1) oldRank0))} is VALID [2022-02-21 03:25:36,400 INFO L290 TraceCheckUtils]: 3: Hoare triple {624#(and (<= 0 (+ (* ackermann_~n 2) 1)) (<= (+ ackermann_~n 1) oldRank0))} assume !(0 == ~n); {493#(and (>= (+ (- 1) (* 2 ackermann_~n)) 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 ackermann_~n))))} is VALID [2022-02-21 03:25:36,400 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:25:36,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:36,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:36,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:36,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,413 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2022-02-21 03:25:36,413 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8 Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:36,564 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 67 transitions. Complement of second has 20 states. [2022-02-21 03:25:36,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:36,564 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:36,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:36,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:36,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:36,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:36,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:36,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:36,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:36,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 67 transitions. [2022-02-21 03:25:36,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:36,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:36,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:36,567 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 28 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:36,567 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:25:36,567 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:36,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:36,568 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:36,568 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 67 transitions. cyclomatic complexity: 22 [2022-02-21 03:25:36,570 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:25:36,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:36,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:36,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:36,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:36,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:36,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:36,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:25:36,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:25:36,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:25:36,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 48 letters. Loop has 48 letters. [2022-02-21 03:25:36,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 48 letters. [2022-02-21 03:25:36,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 48 letters. [2022-02-21 03:25:36,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:25:36,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:25:36,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:25:36,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:25:36,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 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:25:36,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:25:36,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:25:36,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:25:36,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:25:36,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:36,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:36,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:36,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:36,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:36,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:36,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:36,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:36,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:25:36,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:25:36,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:25:36,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:25:36,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:25:36,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:36,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:36,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:36,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:25:36,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:25:36,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:25:36,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:36,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:36,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:36,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:36,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:36,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:36,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:36,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:36,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:36,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:36,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:36,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:36,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:36,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:36,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:36,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:36,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:36,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 22 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:36,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,584 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2022-02-21 03:25:36,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:36,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:25:36,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:25:36,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 67 transitions. cyclomatic complexity: 22 [2022-02-21 03:25:36,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:36,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 42 states and 59 transitions. [2022-02-21 03:25:36,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-02-21 03:25:36,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-02-21 03:25:36,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 59 transitions. [2022-02-21 03:25:36,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:36,593 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 59 transitions. [2022-02-21 03:25:36,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 59 transitions. [2022-02-21 03:25:36,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2022-02-21 03:25:36,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:36,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states and 59 transitions. Second operand has 33 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 03:25:36,596 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states and 59 transitions. Second operand has 33 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 03:25:36,596 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 33 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 03:25:36,597 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:36,604 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2022-02-21 03:25:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2022-02-21 03:25:36,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:36,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:36,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Second operand 42 states and 59 transitions. [2022-02-21 03:25:36,606 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Second operand 42 states and 59 transitions. [2022-02-21 03:25:36,606 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:36,620 INFO L93 Difference]: Finished difference Result 159 states and 214 transitions. [2022-02-21 03:25:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 214 transitions. [2022-02-21 03:25:36,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:36,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:36,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:36,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 03:25:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2022-02-21 03:25:36,623 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2022-02-21 03:25:36,623 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2022-02-21 03:25:36,623 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:25:36,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2022-02-21 03:25:36,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:25:36,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:36,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:36,624 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:36,624 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:25:36,624 INFO L791 eck$LassoCheckResult]: Stem: 709#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 710#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 721#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 722#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 712#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 711#ackermannENTRY ~m := #in~m;~n := #in~n; 713#L17 assume !(0 == ~m); 726#L20 assume !(0 == ~n); 718#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 733#ackermannENTRY ~m := #in~m;~n := #in~n; 740#L17 assume !(0 == ~m); 741#L20 assume 0 == ~n; 728#L21 [2022-02-21 03:25:36,625 INFO L793 eck$LassoCheckResult]: Loop: 728#L21 call #t~ret4 := ackermann(~m - 1, 1);< 725#ackermannENTRY ~m := #in~m;~n := #in~n; 738#L17 assume !(0 == ~m); 739#L20 assume 0 == ~n; 728#L21 [2022-02-21 03:25:36,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1387046543, now seen corresponding path program 1 times [2022-02-21 03:25:36,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:36,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510012948] [2022-02-21 03:25:36,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:36,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:36,649 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:36,670 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:36,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:36,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2199699, now seen corresponding path program 2 times [2022-02-21 03:25:36,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:36,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993348121] [2022-02-21 03:25:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:36,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:36,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {1256#true} call #t~ret4 := ackermann(~m - 1, 1); {1258#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:36,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {1258#(<= 1 |ackermann_#in~n|)} ~m := #in~m;~n := #in~n; {1259#(<= 1 ackermann_~n)} is VALID [2022-02-21 03:25:36,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {1259#(<= 1 ackermann_~n)} assume !(0 == ~m); {1259#(<= 1 ackermann_~n)} is VALID [2022-02-21 03:25:36,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {1259#(<= 1 ackermann_~n)} assume 0 == ~n; {1257#false} is VALID [2022-02-21 03:25:36,717 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:25:36,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:36,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993348121] [2022-02-21 03:25:36,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993348121] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:25:36,718 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:25:36,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:25:36,718 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293996025] [2022-02-21 03:25:36,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:25:36,720 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:25:36,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:36,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:25:36,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:25:36,724 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. cyclomatic complexity: 15 Second operand has 4 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:36,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:36,825 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-02-21 03:25:36,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:25:36,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:36,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:36,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2022-02-21 03:25:36,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2022-02-21 03:25:36,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 45 states and 61 transitions. [2022-02-21 03:25:36,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-02-21 03:25:36,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-02-21 03:25:36,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 61 transitions. [2022-02-21 03:25:36,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:36,835 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 61 transitions. [2022-02-21 03:25:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 61 transitions. [2022-02-21 03:25:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-02-21 03:25:36,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:36,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states and 61 transitions. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 11 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2022-02-21 03:25:36,838 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states and 61 transitions. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 11 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2022-02-21 03:25:36,839 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 11 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2022-02-21 03:25:36,839 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:36,846 INFO L93 Difference]: Finished difference Result 129 states and 170 transitions. [2022-02-21 03:25:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 170 transitions. [2022-02-21 03:25:36,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:36,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:36,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 11 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) Second operand 45 states and 61 transitions. [2022-02-21 03:25:36,848 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 11 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) Second operand 45 states and 61 transitions. [2022-02-21 03:25:36,848 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:36,855 INFO L93 Difference]: Finished difference Result 139 states and 184 transitions. [2022-02-21 03:25:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 184 transitions. [2022-02-21 03:25:36,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:36,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:36,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:36,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 11 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2022-02-21 03:25:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-02-21 03:25:36,859 INFO L704 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-02-21 03:25:36,859 INFO L587 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-02-21 03:25:36,859 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:25:36,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 60 transitions. [2022-02-21 03:25:36,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2022-02-21 03:25:36,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:36,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:36,860 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:36,860 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2022-02-21 03:25:36,861 INFO L791 eck$LassoCheckResult]: Stem: 1309#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1310#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1326#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1327#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 1324#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 1328#ackermannENTRY ~m := #in~m;~n := #in~n; 1352#L17 assume !(0 == ~m); 1330#L20 assume !(0 == ~n); 1319#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 1337#ackermannENTRY ~m := #in~m;~n := #in~n; 1351#L17 assume !(0 == ~m); 1342#L20 assume 0 == ~n; 1339#L21 [2022-02-21 03:25:36,861 INFO L793 eck$LassoCheckResult]: Loop: 1339#L21 call #t~ret4 := ackermann(~m - 1, 1);< 1340#ackermannENTRY ~m := #in~m;~n := #in~n; 1345#L17 assume !(0 == ~m); 1346#L20 assume !(0 == ~n); 1312#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 1311#ackermannENTRY ~m := #in~m;~n := #in~n; 1317#L17 assume !(0 == ~m); 1333#L20 assume 0 == ~n; 1339#L21 [2022-02-21 03:25:36,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:36,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1387046543, now seen corresponding path program 2 times [2022-02-21 03:25:36,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:36,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53376496] [2022-02-21 03:25:36,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:36,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:36,870 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:36,878 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:36,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:36,878 INFO L85 PathProgramCache]: Analyzing trace with hash -47204506, now seen corresponding path program 1 times [2022-02-21 03:25:36,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:36,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486761418] [2022-02-21 03:25:36,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:36,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:36,882 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:36,886 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:36,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:36,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2117341196, now seen corresponding path program 1 times [2022-02-21 03:25:36,887 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:36,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102127994] [2022-02-21 03:25:36,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:36,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:36,897 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:36,907 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:37,157 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:37,157 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:37,157 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:37,157 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:37,157 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:37,157 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,157 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:37,158 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:37,158 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration4_Loop [2022-02-21 03:25:37,158 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:37,158 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:37,158 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:25:37,161 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:25:37,166 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:25:37,168 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:25:37,170 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:25:37,172 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:25:37,173 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:25:37,254 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:37,254 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:37,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,256 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:37,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:25:37,258 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:37,258 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:37,287 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:37,287 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:37,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 03:25:37,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,307 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:37,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:25:37,308 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:37,308 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:37,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:37,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,336 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:37,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:25:37,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:37,337 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:37,521 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:37,521 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=6, ackermann_~m=-2} Honda state: {ackermann_#in~m=6, ackermann_~m=-2} Generalized eigenvectors: [{ackermann_#in~m=-8, ackermann_~m=0}, {ackermann_#in~m=0, ackermann_~m=0}, {ackermann_#in~m=-1, ackermann_~m=-1}] Lambdas: [0, 6, 1] Nus: [0, 0] [2022-02-21 03:25:37,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:37,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,538 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:37,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:25:37,541 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:37,541 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:37,547 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:37,548 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:37,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 03:25:37,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,564 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:37,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:25:37,567 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:37,567 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:37,573 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:37,574 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:37,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:37,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,590 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:37,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:25:37,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:37,593 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:37,600 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:37,600 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:37,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 03:25:37,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,617 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:37,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:25:37,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:37,619 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:37,626 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:37,626 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:37,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:37,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:37,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,642 INFO L229 MonitoredProcess]: Starting monitored process 36 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:25:37,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:25:37,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:37,645 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:37,651 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:37,651 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=0} Honda state: {ackermann_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:37,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 03:25:38,302 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:38,302 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:38,302 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:38,302 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:38,302 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:38,302 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:38,302 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:38,302 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:38,302 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration4_Lasso [2022-02-21 03:25:38,302 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:38,302 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:38,303 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:25:38,321 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:25:38,323 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:25:38,325 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:25:38,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:25:38,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:25:38,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:25:38,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:25:38,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:25:38,354 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:25:38,356 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:25:38,359 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:25:38,361 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:25:38,367 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:25:38,369 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:25:38,372 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:25:38,374 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:25:38,376 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:25:38,378 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:25:38,383 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:25:38,385 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:25:38,396 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:25:38,679 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:38,679 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:38,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:38,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:38,683 INFO L229 MonitoredProcess]: Starting monitored process 37 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:25:38,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:25:38,685 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:25:38,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:38,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:38,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:38,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:38,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:38,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:38,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:38,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:25:38,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:38,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:38,711 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:38,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:25:38,713 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:25:38,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:38,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:38,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:38,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:38,720 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:38,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:38,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:38,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 03:25:38,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:38,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:38,738 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:38,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:25:38,740 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:25:38,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:38,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:38,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:38,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:38,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:38,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:38,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:38,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:38,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:38,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:38,777 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:38,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:25:38,781 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:25:38,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:38,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:38,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:38,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:38,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:38,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:38,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:38,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-02-21 03:25:38,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:38,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:38,807 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:38,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:25:38,809 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:25:38,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:38,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:38,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:38,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:38,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:38,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:38,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:38,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-02-21 03:25:38,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:38,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:38,840 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:38,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:25:38,842 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:25:38,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:38,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:38,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:38,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:38,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:38,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:38,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:38,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:38,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 03:25:38,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:38,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:38,866 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:38,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:25:38,868 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:25:38,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:38,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:38,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:38,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:38,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:38,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:38,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:38,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:38,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 03:25:38,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:38,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:38,891 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:38,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:25:38,894 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:25:38,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:38,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:38,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:38,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:38,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:38,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:38,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:38,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 03:25:38,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:38,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:38,942 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:38,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:25:38,944 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:25:38,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:38,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:38,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:38,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:38,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:38,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:38,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:38,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-02-21 03:25:38,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:38,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:38,987 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:38,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:25:38,990 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:25:38,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:38,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:38,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:38,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:38,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:38,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:39,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 03:25:39,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,017 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:25:39,019 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:25:39,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:39,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:39,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-02-21 03:25:39,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,046 INFO L229 MonitoredProcess]: Starting monitored process 48 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:25:39,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 03:25:39,048 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:25:39,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:39,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:39,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:39,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-02-21 03:25:39,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,073 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 03:25:39,128 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:25:39,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:39,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:39,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-02-21 03:25:39,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,155 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 03:25:39,158 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:25:39,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:39,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:39,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:39,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,190 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 03:25:39,192 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:25:39,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:39,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:39,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:39,200 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-02-21 03:25:39,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,217 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 03:25:39,219 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:25:39,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:39,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:39,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:39,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-02-21 03:25:39,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,244 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 03:25:39,246 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:25:39,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:39,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:39,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:39,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-02-21 03:25:39,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,271 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 03:25:39,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:39,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:39,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:39,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:39,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-02-21 03:25:39,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,297 INFO L229 MonitoredProcess]: Starting monitored process 55 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:25:39,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 03:25:39,299 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:25:39,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:39,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:39,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:39,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:39,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,334 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 03:25:39,336 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:25:39,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:39,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:39,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:39,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-02-21 03:25:39,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,360 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 03:25:39,361 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:25:39,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:39,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:39,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:39,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-02-21 03:25:39,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,386 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-02-21 03:25:39,389 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:25:39,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:39,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:39,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:39,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-02-21 03:25:39,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,414 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-02-21 03:25:39,416 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:25:39,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:39,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:39,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:39,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:39,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,440 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-02-21 03:25:39,441 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:25:39,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:39,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:39,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:39,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,467 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-02-21 03:25:39,469 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:25:39,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:39,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:39,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-02-21 03:25:39,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,495 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-02-21 03:25:39,496 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:25:39,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:39,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:39,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:39,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:39,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-02-21 03:25:39,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,523 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-02-21 03:25:39,526 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:25:39,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,532 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:25:39,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,537 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 03:25:39,537 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:25:39,548 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:39,570 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-02-21 03:25:39,571 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-02-21 03:25:39,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,576 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-02-21 03:25:39,578 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:39,605 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-02-21 03:25:39,605 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:39,606 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~m) = 1*ackermann_~m Supporting invariants [2*ackermann_~m - 1 >= 0] [2022-02-21 03:25:39,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:39,642 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2022-02-21 03:25:39,649 INFO L390 LassoCheck]: Loop: "call #t~ret4 := ackermann(~m - 1, 1);"< "~m := #in~m;~n := #in~n;" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret5 := ackermann(~m, ~n - 1);"< "~m := #in~m;~n := #in~n;" "assume !(0 == ~m);" "assume 0 == ~n;" [2022-02-21 03:25:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:39,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:39,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:25:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:39,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:39,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {1892#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1892#unseeded} is VALID [2022-02-21 03:25:39,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {1892#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1892#unseeded} is VALID [2022-02-21 03:25:39,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {1892#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1931#(and unseeded (not (< |ULTIMATE.start_main_~m~0#1| 0)))} is VALID [2022-02-21 03:25:39,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {1931#(and unseeded (not (< |ULTIMATE.start_main_~m~0#1| 0)))} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {1931#(and unseeded (not (< |ULTIMATE.start_main_~m~0#1| 0)))} is VALID [2022-02-21 03:25:39,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {1931#(and unseeded (not (< |ULTIMATE.start_main_~m~0#1| 0)))} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {1938#(and (<= 0 |ackermann_#in~m|) unseeded)} is VALID [2022-02-21 03:25:39,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {1938#(and (<= 0 |ackermann_#in~m|) unseeded)} ~m := #in~m;~n := #in~n; {1942#(and unseeded (<= 0 ackermann_~m))} is VALID [2022-02-21 03:25:39,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {1942#(and unseeded (<= 0 ackermann_~m))} assume !(0 == ~m); {1942#(and unseeded (<= 0 ackermann_~m))} is VALID [2022-02-21 03:25:39,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {1942#(and unseeded (<= 0 ackermann_~m))} assume !(0 == ~n); {1942#(and unseeded (<= 0 ackermann_~m))} is VALID [2022-02-21 03:25:39,876 INFO L272 TraceCheckUtils]: 8: Hoare triple {1942#(and unseeded (<= 0 ackermann_~m))} call #t~ret5 := ackermann(~m, ~n - 1); {1938#(and (<= 0 |ackermann_#in~m|) unseeded)} is VALID [2022-02-21 03:25:39,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {1938#(and (<= 0 |ackermann_#in~m|) unseeded)} ~m := #in~m;~n := #in~n; {1942#(and unseeded (<= 0 ackermann_~m))} is VALID [2022-02-21 03:25:39,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {1942#(and unseeded (<= 0 ackermann_~m))} assume !(0 == ~m); {1916#(and unseeded (>= (+ (- 1) (* 2 ackermann_~m)) 0))} is VALID [2022-02-21 03:25:39,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {1916#(and unseeded (>= (+ (- 1) (* 2 ackermann_~m)) 0))} assume 0 == ~n; {1916#(and unseeded (>= (+ (- 1) (* 2 ackermann_~m)) 0))} is VALID [2022-02-21 03:25:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:39,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:25:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:39,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:40,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {1917#(and (>= oldRank0 ackermann_~m) (>= (+ (- 1) (* 2 ackermann_~m)) 0))} call #t~ret4 := ackermann(~m - 1, 1); {1961#(and (<= (+ |ackermann_#in~m| 1) oldRank0) (<= 0 (+ (* |ackermann_#in~m| 2) 1)))} is VALID [2022-02-21 03:25:40,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {1961#(and (<= (+ |ackermann_#in~m| 1) oldRank0) (<= 0 (+ (* |ackermann_#in~m| 2) 1)))} ~m := #in~m;~n := #in~n; {1965#(and (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} is VALID [2022-02-21 03:25:40,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {1965#(and (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} assume !(0 == ~m); {1965#(and (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} is VALID [2022-02-21 03:25:40,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {1965#(and (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} assume !(0 == ~n); {1965#(and (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} is VALID [2022-02-21 03:25:40,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {1965#(and (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} call #t~ret5 := ackermann(~m, ~n - 1); {1961#(and (<= (+ |ackermann_#in~m| 1) oldRank0) (<= 0 (+ (* |ackermann_#in~m| 2) 1)))} is VALID [2022-02-21 03:25:40,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {1961#(and (<= (+ |ackermann_#in~m| 1) oldRank0) (<= 0 (+ (* |ackermann_#in~m| 2) 1)))} ~m := #in~m;~n := #in~n; {1965#(and (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} is VALID [2022-02-21 03:25:40,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {1965#(and (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} assume !(0 == ~m); {1981#(and (not (= ackermann_~m 0)) (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} is VALID [2022-02-21 03:25:40,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {1981#(and (not (= ackermann_~m 0)) (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} assume 0 == ~n; {1919#(and (or (and (>= oldRank0 0) (> oldRank0 ackermann_~m)) unseeded) (>= (+ (- 1) (* 2 ackermann_~m)) 0))} is VALID [2022-02-21 03:25:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:25:40,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:40,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:40,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:25:40,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,086 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 4 loop predicates [2022-02-21 03:25:40,086 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 60 transitions. cyclomatic complexity: 18 Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:40,272 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 60 transitions. cyclomatic complexity: 18. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 75 states and 106 transitions. Complement of second has 14 states. [2022-02-21 03:25:40,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2022-02-21 03:25:40,272 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:40,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 60 transitions. cyclomatic complexity: 18 [2022-02-21 03:25:40,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:40,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:40,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:40,274 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:40,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:40,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 106 transitions. [2022-02-21 03:25:40,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2022-02-21 03:25:40,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:40,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:40,276 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 44 states and 60 transitions. cyclomatic complexity: 18 [2022-02-21 03:25:40,279 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:25:40,279 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:40,280 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:40,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 21 transitions. cyclomatic complexity: 16 [2022-02-21 03:25:40,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:40,280 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:25:40,280 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 75 states and 106 transitions. cyclomatic complexity: 35 [2022-02-21 03:25:40,284 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 20 examples of accepted words. [2022-02-21 03:25:40,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:25:40,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:25:40,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:25:40,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:40,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:40,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:40,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 75 letters. Loop has 75 letters. [2022-02-21 03:25:40,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 75 letters. [2022-02-21 03:25:40,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 75 letters. Loop has 75 letters. [2022-02-21 03:25:40,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:25:40,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:25:40,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:25:40,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:25:40,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 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:25:40,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:25:40,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:25:40,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:25:40,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:25:40,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:40,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:40,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:40,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 8 letters. [2022-02-21 03:25:40,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 8 letters. [2022-02-21 03:25:40,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 8 letters. [2022-02-21 03:25:40,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:40,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:40,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:40,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:25:40,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:25:40,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:25:40,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 24 letters. Loop has 13 letters. [2022-02-21 03:25:40,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 13 letters. [2022-02-21 03:25:40,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 24 letters. Loop has 13 letters. [2022-02-21 03:25:40,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:40,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:40,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:40,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:40,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:40,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:40,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:25:40,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:25:40,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:25:40,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:25:40,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:25:40,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:25:40,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:40,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:40,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:40,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 24 letters. Loop has 13 letters. [2022-02-21 03:25:40,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 13 letters. [2022-02-21 03:25:40,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 24 letters. Loop has 13 letters. [2022-02-21 03:25:40,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:40,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:40,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:40,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:40,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:40,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:40,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:25:40,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:25:40,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:25:40,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:40,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:40,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:40,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 8 letters. [2022-02-21 03:25:40,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 8 letters. [2022-02-21 03:25:40,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 19 letters. Loop has 8 letters. [2022-02-21 03:25:40,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:25:40,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:25:40,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:25:40,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:25:40,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:25:40,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:25:40,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:40,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:40,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:40,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:25:40,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:25:40,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:25:40,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:40,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:40,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:40,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:25:40,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:25:40,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:25:40,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 8 letters. [2022-02-21 03:25:40,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 8 letters. [2022-02-21 03:25:40,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 8 letters. [2022-02-21 03:25:40,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:40,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:40,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:40,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:40,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:40,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:40,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:40,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:40,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:40,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:40,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:40,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:40,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 21 letters. [2022-02-21 03:25:40,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 21 letters. [2022-02-21 03:25:40,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 21 letters. [2022-02-21 03:25:40,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:40,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:40,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:40,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:40,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:40,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:40,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 9 letters. [2022-02-21 03:25:40,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 9 letters. [2022-02-21 03:25:40,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 9 letters. [2022-02-21 03:25:40,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 21 letters. [2022-02-21 03:25:40,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 21 letters. [2022-02-21 03:25:40,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 106 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 21 letters. [2022-02-21 03:25:40,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,345 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:40,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-02-21 03:25:40,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:25:40,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,348 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:40,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:40,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:25:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:40,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:40,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {1892#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1892#unseeded} is VALID [2022-02-21 03:25:40,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {1892#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1892#unseeded} is VALID [2022-02-21 03:25:40,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {1892#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {2097#(and unseeded (not (< |ULTIMATE.start_main_~m~0#1| 0)))} is VALID [2022-02-21 03:25:40,524 INFO L290 TraceCheckUtils]: 3: Hoare triple {2097#(and unseeded (not (< |ULTIMATE.start_main_~m~0#1| 0)))} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {2097#(and unseeded (not (< |ULTIMATE.start_main_~m~0#1| 0)))} is VALID [2022-02-21 03:25:40,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {2097#(and unseeded (not (< |ULTIMATE.start_main_~m~0#1| 0)))} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {2104#(and (<= 0 |ackermann_#in~m|) unseeded)} is VALID [2022-02-21 03:25:40,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {2104#(and (<= 0 |ackermann_#in~m|) unseeded)} ~m := #in~m;~n := #in~n; {2108#(and unseeded (<= 0 ackermann_~m))} is VALID [2022-02-21 03:25:40,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {2108#(and unseeded (<= 0 ackermann_~m))} assume !(0 == ~m); {2108#(and unseeded (<= 0 ackermann_~m))} is VALID [2022-02-21 03:25:40,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {2108#(and unseeded (<= 0 ackermann_~m))} assume !(0 == ~n); {2108#(and unseeded (<= 0 ackermann_~m))} is VALID [2022-02-21 03:25:40,526 INFO L272 TraceCheckUtils]: 8: Hoare triple {2108#(and unseeded (<= 0 ackermann_~m))} call #t~ret5 := ackermann(~m, ~n - 1); {2104#(and (<= 0 |ackermann_#in~m|) unseeded)} is VALID [2022-02-21 03:25:40,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {2104#(and (<= 0 |ackermann_#in~m|) unseeded)} ~m := #in~m;~n := #in~n; {2108#(and unseeded (<= 0 ackermann_~m))} is VALID [2022-02-21 03:25:40,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {2108#(and unseeded (<= 0 ackermann_~m))} assume !(0 == ~m); {1916#(and unseeded (>= (+ (- 1) (* 2 ackermann_~m)) 0))} is VALID [2022-02-21 03:25:40,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {1916#(and unseeded (>= (+ (- 1) (* 2 ackermann_~m)) 0))} assume 0 == ~n; {1916#(and unseeded (>= (+ (- 1) (* 2 ackermann_~m)) 0))} is VALID [2022-02-21 03:25:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:40,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:25:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:40,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:40,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {1917#(and (>= oldRank0 ackermann_~m) (>= (+ (- 1) (* 2 ackermann_~m)) 0))} call #t~ret4 := ackermann(~m - 1, 1); {2127#(and (<= (+ |ackermann_#in~m| 1) oldRank0) (<= 0 (+ (* |ackermann_#in~m| 2) 1)))} is VALID [2022-02-21 03:25:40,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {2127#(and (<= (+ |ackermann_#in~m| 1) oldRank0) (<= 0 (+ (* |ackermann_#in~m| 2) 1)))} ~m := #in~m;~n := #in~n; {2131#(and (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} is VALID [2022-02-21 03:25:40,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {2131#(and (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} assume !(0 == ~m); {2131#(and (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} is VALID [2022-02-21 03:25:40,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {2131#(and (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} assume !(0 == ~n); {2131#(and (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} is VALID [2022-02-21 03:25:40,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {2131#(and (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} call #t~ret5 := ackermann(~m, ~n - 1); {2127#(and (<= (+ |ackermann_#in~m| 1) oldRank0) (<= 0 (+ (* |ackermann_#in~m| 2) 1)))} is VALID [2022-02-21 03:25:40,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {2127#(and (<= (+ |ackermann_#in~m| 1) oldRank0) (<= 0 (+ (* |ackermann_#in~m| 2) 1)))} ~m := #in~m;~n := #in~n; {2131#(and (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} is VALID [2022-02-21 03:25:40,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {2131#(and (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} assume !(0 == ~m); {2147#(and (not (= ackermann_~m 0)) (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} is VALID [2022-02-21 03:25:40,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {2147#(and (not (= ackermann_~m 0)) (<= (+ ackermann_~m 1) oldRank0) (<= 0 (+ (* ackermann_~m 2) 1)))} assume 0 == ~n; {1919#(and (or (and (>= oldRank0 0) (> oldRank0 ackermann_~m)) unseeded) (>= (+ (- 1) (* 2 ackermann_~m)) 0))} is VALID [2022-02-21 03:25:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:25:40,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:40,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:40,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:25:40,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,730 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 4 loop predicates [2022-02-21 03:25:40,730 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 60 transitions. cyclomatic complexity: 18 Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:41,160 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 60 transitions. cyclomatic complexity: 18. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 151 states and 223 transitions. Complement of second has 31 states. [2022-02-21 03:25:41,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 5 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:41,161 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:41,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 60 transitions. cyclomatic complexity: 18 [2022-02-21 03:25:41,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:41,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:41,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:41,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:41,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:41,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:41,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 223 transitions. [2022-02-21 03:25:41,165 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2022-02-21 03:25:41,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:41,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:41,166 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 44 states and 60 transitions. cyclomatic complexity: 18 [2022-02-21 03:25:41,166 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:25:41,166 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:41,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:41,167 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:41,168 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 151 states and 223 transitions. cyclomatic complexity: 79 [2022-02-21 03:25:41,172 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 24 examples of accepted words. [2022-02-21 03:25:41,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:25:41,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:25:41,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:25:41,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:25:41,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:25:41,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:25:41,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:41,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:41,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:41,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 151 letters. Loop has 151 letters. [2022-02-21 03:25:41,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 151 letters. [2022-02-21 03:25:41,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 151 letters. Loop has 151 letters. [2022-02-21 03:25:41,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:25:41,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:25:41,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:25:41,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:25:41,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 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:25:41,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:25:41,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:25:41,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:25:41,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:25:41,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:41,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:41,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:41,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 8 letters. [2022-02-21 03:25:41,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 8 letters. [2022-02-21 03:25:41,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 14 letters. Loop has 8 letters. [2022-02-21 03:25:41,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:41,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:41,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:41,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:25:41,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:25:41,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:25:41,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 24 letters. Loop has 13 letters. [2022-02-21 03:25:41,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 13 letters. [2022-02-21 03:25:41,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 24 letters. Loop has 13 letters. [2022-02-21 03:25:41,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:41,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:41,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:41,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:41,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:41,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:41,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:25:41,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:25:41,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:25:41,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:25:41,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:25:41,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:25:41,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:41,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:41,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:41,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 24 letters. Loop has 13 letters. [2022-02-21 03:25:41,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 13 letters. [2022-02-21 03:25:41,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 24 letters. Loop has 13 letters. [2022-02-21 03:25:41,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:41,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:41,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:41,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:25:41,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:25:41,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:25:41,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:25:41,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:25:41,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:25:41,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:41,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:41,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:41,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:41,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:41,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:41,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:25:41,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:25:41,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:25:41,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:41,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:41,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:41,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:41,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:41,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:41,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:41,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:41,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:41,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:41,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:41,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:41,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 48 letters. Loop has 13 letters. [2022-02-21 03:25:41,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 13 letters. [2022-02-21 03:25:41,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 48 letters. Loop has 13 letters. [2022-02-21 03:25:41,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:41,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:41,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:41,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:41,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:41,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:41,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:41,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:41,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:41,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:41,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:41,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:41,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:41,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:41,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:41,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:41,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:41,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:41,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 48 letters. Loop has 13 letters. [2022-02-21 03:25:41,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 13 letters. [2022-02-21 03:25:41,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 48 letters. Loop has 13 letters. [2022-02-21 03:25:41,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:41,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:41,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:25:41,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:41,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:41,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:41,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:41,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:41,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:41,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 21 letters. [2022-02-21 03:25:41,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 21 letters. [2022-02-21 03:25:41,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 17 letters. Loop has 21 letters. [2022-02-21 03:25:41,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:41,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:41,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:41,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:41,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:41,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:41,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 21 letters. [2022-02-21 03:25:41,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 21 letters. [2022-02-21 03:25:41,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 17 letters. Loop has 21 letters. [2022-02-21 03:25:41,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 60 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 9 letters. [2022-02-21 03:25:41,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 9 letters. [2022-02-21 03:25:41,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 151 states and 223 transitions. cyclomatic complexity: 79 Stem has 17 letters. Loop has 9 letters. [2022-02-21 03:25:41,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,220 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2022-02-21 03:25:41,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:25:41,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 20 letters. Loop has 8 letters. [2022-02-21 03:25:41,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 12 letters. Loop has 16 letters. [2022-02-21 03:25:41,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 223 transitions. cyclomatic complexity: 79 [2022-02-21 03:25:41,233 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2022-02-21 03:25:41,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 115 states and 180 transitions. [2022-02-21 03:25:41,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2022-02-21 03:25:41,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-02-21 03:25:41,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 180 transitions. [2022-02-21 03:25:41,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:41,242 INFO L681 BuchiCegarLoop]: Abstraction has 115 states and 180 transitions. [2022-02-21 03:25:41,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 180 transitions. [2022-02-21 03:25:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2022-02-21 03:25:41,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:41,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states and 180 transitions. Second operand has 110 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (36), 15 states have call predecessors, (36), 13 states have return successors, (54), 18 states have call predecessors, (54), 20 states have call successors, (54) [2022-02-21 03:25:41,250 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states and 180 transitions. Second operand has 110 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (36), 15 states have call predecessors, (36), 13 states have return successors, (54), 18 states have call predecessors, (54), 20 states have call successors, (54) [2022-02-21 03:25:41,250 INFO L87 Difference]: Start difference. First operand 115 states and 180 transitions. Second operand has 110 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (36), 15 states have call predecessors, (36), 13 states have return successors, (54), 18 states have call predecessors, (54), 20 states have call successors, (54) [2022-02-21 03:25:41,251 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:41,296 INFO L93 Difference]: Finished difference Result 417 states and 618 transitions. [2022-02-21 03:25:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 618 transitions. [2022-02-21 03:25:41,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:41,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:41,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (36), 15 states have call predecessors, (36), 13 states have return successors, (54), 18 states have call predecessors, (54), 20 states have call successors, (54) Second operand 115 states and 180 transitions. [2022-02-21 03:25:41,301 INFO L87 Difference]: Start difference. First operand has 110 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (36), 15 states have call predecessors, (36), 13 states have return successors, (54), 18 states have call predecessors, (54), 20 states have call successors, (54) Second operand 115 states and 180 transitions. [2022-02-21 03:25:41,302 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:41,345 INFO L93 Difference]: Finished difference Result 436 states and 648 transitions. [2022-02-21 03:25:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 648 transitions. [2022-02-21 03:25:41,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:41,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:41,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:41,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (36), 15 states have call predecessors, (36), 13 states have return successors, (54), 18 states have call predecessors, (54), 20 states have call successors, (54) [2022-02-21 03:25:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 175 transitions. [2022-02-21 03:25:41,354 INFO L704 BuchiCegarLoop]: Abstraction has 110 states and 175 transitions. [2022-02-21 03:25:41,354 INFO L587 BuchiCegarLoop]: Abstraction has 110 states and 175 transitions. [2022-02-21 03:25:41,354 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:25:41,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 175 transitions. [2022-02-21 03:25:41,356 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2022-02-21 03:25:41,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:41,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:41,357 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:41,357 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:25:41,357 INFO L791 eck$LassoCheckResult]: Stem: 2347#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 2348#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 2364#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 2365#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 2366#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 2367#ackermannENTRY ~m := #in~m;~n := #in~n; 2414#L17 assume !(0 == ~m); 2415#L20 assume !(0 == ~n); 2357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 2393#ackermannENTRY ~m := #in~m;~n := #in~n; 2417#L17 assume 0 == ~m;#res := 1 + ~n; 2355#ackermannFINAL assume true; 2358#ackermannEXIT >#45#return; 2369#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 2382#ackermannENTRY [2022-02-21 03:25:41,357 INFO L793 eck$LassoCheckResult]: Loop: 2382#ackermannENTRY ~m := #in~m;~n := #in~n; 2454#L17 assume !(0 == ~m); 2453#L20 assume !(0 == ~n); 2390#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 2382#ackermannENTRY [2022-02-21 03:25:41,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1511844440, now seen corresponding path program 1 times [2022-02-21 03:25:41,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:41,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216877533] [2022-02-21 03:25:41,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:41,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:41,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:25:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:41,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {4073#true} ~m := #in~m;~n := #in~n; {4083#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:41,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {4083#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {4084#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:41,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {4084#(= |ackermann_#in~m| 0)} assume true; {4084#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:41,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4084#(= |ackermann_#in~m| 0)} {4078#(< 0 ackermann_~m)} #45#return; {4074#false} is VALID [2022-02-21 03:25:41,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {4073#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4073#true} is VALID [2022-02-21 03:25:41,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {4073#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {4073#true} is VALID [2022-02-21 03:25:41,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {4073#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4075#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:25:41,427 INFO L290 TraceCheckUtils]: 3: Hoare triple {4075#(<= 0 |ULTIMATE.start_main_~m~0#1|)} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {4075#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:25:41,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {4075#(<= 0 |ULTIMATE.start_main_~m~0#1|)} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {4076#(<= 0 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:41,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {4076#(<= 0 |ackermann_#in~m|)} ~m := #in~m;~n := #in~n; {4077#(< 0 (+ ackermann_~m 1))} is VALID [2022-02-21 03:25:41,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {4077#(< 0 (+ ackermann_~m 1))} assume !(0 == ~m); {4078#(< 0 ackermann_~m)} is VALID [2022-02-21 03:25:41,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {4078#(< 0 ackermann_~m)} assume !(0 == ~n); {4078#(< 0 ackermann_~m)} is VALID [2022-02-21 03:25:41,429 INFO L272 TraceCheckUtils]: 8: Hoare triple {4078#(< 0 ackermann_~m)} call #t~ret5 := ackermann(~m, ~n - 1); {4073#true} is VALID [2022-02-21 03:25:41,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {4073#true} ~m := #in~m;~n := #in~n; {4083#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:41,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {4083#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {4084#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:41,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {4084#(= |ackermann_#in~m| 0)} assume true; {4084#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:41,431 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4084#(= |ackermann_#in~m| 0)} {4078#(< 0 ackermann_~m)} #45#return; {4074#false} is VALID [2022-02-21 03:25:41,431 INFO L272 TraceCheckUtils]: 13: Hoare triple {4074#false} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4074#false} is VALID [2022-02-21 03:25:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:41,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:41,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216877533] [2022-02-21 03:25:41,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216877533] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:25:41,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797063344] [2022-02-21 03:25:41,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:41,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:25:41,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:41,433 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:25:41,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-02-21 03:25:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:41,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:25:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:41,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:41,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {4073#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4073#true} is VALID [2022-02-21 03:25:41,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {4073#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {4073#true} is VALID [2022-02-21 03:25:41,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {4073#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4073#true} is VALID [2022-02-21 03:25:41,522 INFO L290 TraceCheckUtils]: 3: Hoare triple {4073#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {4073#true} is VALID [2022-02-21 03:25:41,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {4073#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {4073#true} is VALID [2022-02-21 03:25:41,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {4073#true} ~m := #in~m;~n := #in~n; {4073#true} is VALID [2022-02-21 03:25:41,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {4073#true} assume !(0 == ~m); {4106#(not (= ackermann_~m 0))} is VALID [2022-02-21 03:25:41,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {4106#(not (= ackermann_~m 0))} assume !(0 == ~n); {4106#(not (= ackermann_~m 0))} is VALID [2022-02-21 03:25:41,523 INFO L272 TraceCheckUtils]: 8: Hoare triple {4106#(not (= ackermann_~m 0))} call #t~ret5 := ackermann(~m, ~n - 1); {4073#true} is VALID [2022-02-21 03:25:41,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {4073#true} ~m := #in~m;~n := #in~n; {4083#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:41,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {4083#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {4084#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:41,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {4084#(= |ackermann_#in~m| 0)} assume true; {4084#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:41,527 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4084#(= |ackermann_#in~m| 0)} {4106#(not (= ackermann_~m 0))} #45#return; {4074#false} is VALID [2022-02-21 03:25:41,527 INFO L272 TraceCheckUtils]: 13: Hoare triple {4074#false} call #t~ret6 := ackermann(~m - 1, #t~ret5); {4074#false} is VALID [2022-02-21 03:25:41,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:25:41,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:25:41,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797063344] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:25:41,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:25:41,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-02-21 03:25:41,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251742597] [2022-02-21 03:25:41,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:25:41,528 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:25:41,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:41,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1697294, now seen corresponding path program 2 times [2022-02-21 03:25:41,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:41,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539053324] [2022-02-21 03:25:41,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:41,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:41,531 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:41,534 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:41,607 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:41,607 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:41,607 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:41,607 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:41,608 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:41,608 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:41,608 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:41,608 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:41,608 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration5_Loop [2022-02-21 03:25:41,608 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:41,608 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:41,608 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:25:41,612 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:25:41,616 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:25:41,618 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:25:41,619 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:25:41,621 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:25:41,623 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:25:41,624 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:25:41,699 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:41,699 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:41,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:41,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:41,701 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:41,708 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:41,708 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:41,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-02-21 03:25:41,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:41,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:41,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:41,751 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:41,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-02-21 03:25:41,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:41,754 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:41,788 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:41,788 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=-4} Honda state: {ackermann_#in~n=-4} Generalized eigenvectors: [{ackermann_#in~n=0}, {ackermann_#in~n=-1}, {ackermann_#in~n=0}] Lambdas: [15, 1, 13] Nus: [0, 0] [2022-02-21 03:25:41,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:41,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:41,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:41,815 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:41,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-02-21 03:25:41,819 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:41,819 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:41,829 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:41,829 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=4} Honda state: {ackermann_#in~m=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:41,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-02-21 03:25:41,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:41,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:41,845 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:41,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-02-21 03:25:41,847 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:41,847 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:41,853 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:41,853 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:41,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-02-21 03:25:41,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:41,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:41,869 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:41,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-02-21 03:25:41,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:41,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:41,877 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:41,877 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:41,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-02-21 03:25:41,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:41,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:41,892 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:41,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-02-21 03:25:41,895 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:41,895 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:41,927 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:41,927 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:41,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:41,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:41,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:41,947 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:41,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-02-21 03:25:41,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:41,952 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:41,959 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:41,959 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:41,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-02-21 03:25:41,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:41,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:41,975 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:41,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-02-21 03:25:41,977 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:41,977 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:41,983 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:41,983 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:41,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-02-21 03:25:41,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:42,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:42,000 INFO L229 MonitoredProcess]: Starting monitored process 74 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:25:42,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-02-21 03:25:42,002 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:42,002 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:42,008 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:42,008 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:42,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:42,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:42,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:25:42,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:25:42,024 INFO L87 Difference]: Start difference. First operand 110 states and 175 transitions. cyclomatic complexity: 71 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:25:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:42,139 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2022-02-21 03:25:42,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:25:42,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:25:42,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:42,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 111 transitions. [2022-02-21 03:25:42,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-02-21 03:25:42,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 76 states and 105 transitions. [2022-02-21 03:25:42,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2022-02-21 03:25:42,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2022-02-21 03:25:42,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 105 transitions. [2022-02-21 03:25:42,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:42,159 INFO L681 BuchiCegarLoop]: Abstraction has 76 states and 105 transitions. [2022-02-21 03:25:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 105 transitions. [2022-02-21 03:25:42,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-02-21 03:25:42,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:42,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states and 105 transitions. Second operand has 76 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 56 states have internal predecessors, (59), 16 states have call successors, (22), 12 states have call predecessors, (22), 7 states have return successors, (24), 7 states have call predecessors, (24), 13 states have call successors, (24) [2022-02-21 03:25:42,164 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states and 105 transitions. Second operand has 76 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 56 states have internal predecessors, (59), 16 states have call successors, (22), 12 states have call predecessors, (22), 7 states have return successors, (24), 7 states have call predecessors, (24), 13 states have call successors, (24) [2022-02-21 03:25:42,164 INFO L87 Difference]: Start difference. First operand 76 states and 105 transitions. Second operand has 76 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 56 states have internal predecessors, (59), 16 states have call successors, (22), 12 states have call predecessors, (22), 7 states have return successors, (24), 7 states have call predecessors, (24), 13 states have call successors, (24) [2022-02-21 03:25:42,164 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:42,179 INFO L93 Difference]: Finished difference Result 208 states and 281 transitions. [2022-02-21 03:25:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 281 transitions. [2022-02-21 03:25:42,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:42,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:42,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 56 states have internal predecessors, (59), 16 states have call successors, (22), 12 states have call predecessors, (22), 7 states have return successors, (24), 7 states have call predecessors, (24), 13 states have call successors, (24) Second operand 76 states and 105 transitions. [2022-02-21 03:25:42,181 INFO L87 Difference]: Start difference. First operand has 76 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 56 states have internal predecessors, (59), 16 states have call successors, (22), 12 states have call predecessors, (22), 7 states have return successors, (24), 7 states have call predecessors, (24), 13 states have call successors, (24) Second operand 76 states and 105 transitions. [2022-02-21 03:25:42,182 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:42,188 INFO L93 Difference]: Finished difference Result 208 states and 281 transitions. [2022-02-21 03:25:42,189 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 281 transitions. [2022-02-21 03:25:42,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:42,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:42,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:42,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 56 states have internal predecessors, (59), 16 states have call successors, (22), 12 states have call predecessors, (22), 7 states have return successors, (24), 7 states have call predecessors, (24), 13 states have call successors, (24) [2022-02-21 03:25:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 105 transitions. [2022-02-21 03:25:42,193 INFO L704 BuchiCegarLoop]: Abstraction has 76 states and 105 transitions. [2022-02-21 03:25:42,193 INFO L587 BuchiCegarLoop]: Abstraction has 76 states and 105 transitions. [2022-02-21 03:25:42,193 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:25:42,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 105 transitions. [2022-02-21 03:25:42,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-02-21 03:25:42,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:42,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:42,194 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:42,194 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:25:42,195 INFO L791 eck$LassoCheckResult]: Stem: 4213#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 4214#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 4223#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 4224#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 4225#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 4226#ackermannENTRY ~m := #in~m;~n := #in~n; 4275#L17 assume !(0 == ~m); 4272#L20 assume !(0 == ~n); 4246#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4262#ackermannENTRY ~m := #in~m;~n := #in~n; 4279#L17 assume !(0 == ~m); 4278#L20 assume 0 == ~n; 4235#L21 call #t~ret4 := ackermann(~m - 1, 1);< 4241#ackermannENTRY ~m := #in~m;~n := #in~n; 4276#L17 assume !(0 == ~m); 4277#L20 [2022-02-21 03:25:42,195 INFO L793 eck$LassoCheckResult]: Loop: 4277#L20 assume !(0 == ~n); 4250#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4251#ackermannENTRY ~m := #in~m;~n := #in~n; 4281#L17 assume !(0 == ~m); 4277#L20 [2022-02-21 03:25:42,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:42,195 INFO L85 PathProgramCache]: Analyzing trace with hash -376751137, now seen corresponding path program 2 times [2022-02-21 03:25:42,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:42,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863542568] [2022-02-21 03:25:42,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:42,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:42,220 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:42,234 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:42,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:42,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2009294, now seen corresponding path program 3 times [2022-02-21 03:25:42,234 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:42,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991504084] [2022-02-21 03:25:42,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:42,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:42,237 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:42,238 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:42,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:42,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2009908652, now seen corresponding path program 3 times [2022-02-21 03:25:42,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:42,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578127267] [2022-02-21 03:25:42,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:42,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:42,247 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:42,266 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:42,358 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:42,358 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:42,358 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:42,358 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:42,358 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:42,358 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:42,359 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:42,359 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:42,359 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration6_Loop [2022-02-21 03:25:42,359 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:42,359 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:42,360 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:25:42,362 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:25:42,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:42,365 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:25:42,369 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:25:42,377 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:25:42,472 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:42,473 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:42,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:42,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:42,476 INFO L229 MonitoredProcess]: Starting monitored process 75 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:25:42,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-02-21 03:25:42,480 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:42,480 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:42,486 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:42,486 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:42,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:42,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:42,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:42,501 INFO L229 MonitoredProcess]: Starting monitored process 76 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:25:42,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-02-21 03:25:42,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:42,503 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:42,509 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:42,509 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:42,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:42,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:42,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:42,524 INFO L229 MonitoredProcess]: Starting monitored process 77 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:25:42,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-02-21 03:25:42,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:42,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:42,532 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:42,532 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:42,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-02-21 03:25:42,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:42,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:42,548 INFO L229 MonitoredProcess]: Starting monitored process 78 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:25:42,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-02-21 03:25:42,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:42,550 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:42,560 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:42,560 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=7, ackermann_~m=7} Honda state: {ackermann_#in~m=7, ackermann_~m=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:42,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2022-02-21 03:25:42,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:42,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:42,576 INFO L229 MonitoredProcess]: Starting monitored process 79 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:25:42,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-02-21 03:25:42,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:42,578 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:42,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-02-21 03:25:42,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:42,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:42,605 INFO L229 MonitoredProcess]: Starting monitored process 80 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:25:42,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-02-21 03:25:42,607 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:42,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:42,648 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:42,648 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=-4, ackermann_#in~n=-5} Honda state: {ackermann_~n=-4, ackermann_#in~n=-5} Generalized eigenvectors: [{ackermann_~n=-1, ackermann_#in~n=5}, {ackermann_~n=0, ackermann_#in~n=-6}, {ackermann_~n=0, ackermann_#in~n=1}] Lambdas: [1, 0, 0] Nus: [1, 0] [2022-02-21 03:25:42,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-02-21 03:25:42,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:42,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:42,665 INFO L229 MonitoredProcess]: Starting monitored process 81 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:25:42,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-02-21 03:25:42,666 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:42,666 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:42,672 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:42,672 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:42,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-02-21 03:25:43,436 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:43,437 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:43,437 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:43,437 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:43,437 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:43,437 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:43,437 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:43,437 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:43,437 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration6_Lasso [2022-02-21 03:25:43,437 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:43,437 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:43,439 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:25:43,450 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:25:43,451 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:25:43,453 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:25:43,455 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:25:43,457 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:25:43,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:43,471 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:25:43,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:43,474 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:25:43,476 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:25:43,478 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:25:43,480 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:25:43,481 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:25:43,483 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:25:43,485 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:25:43,487 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:25:43,495 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:25:43,497 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:25:43,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:43,505 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:25:43,522 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:25:43,794 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:43,795 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:43,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:43,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:43,796 INFO L229 MonitoredProcess]: Starting monitored process 82 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:25:43,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-02-21 03:25:43,805 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:25:43,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:43,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:43,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:43,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:43,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:43,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:43,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:43,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-02-21 03:25:43,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:43,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:43,854 INFO L229 MonitoredProcess]: Starting monitored process 83 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:25:43,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-02-21 03:25:43,856 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:25:43,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:43,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:43,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:43,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:43,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:43,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:43,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:43,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:43,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:43,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:43,881 INFO L229 MonitoredProcess]: Starting monitored process 84 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:25:43,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-02-21 03:25:43,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:43,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:43,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:43,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:43,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:43,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:43,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:43,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:43,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-02-21 03:25:43,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:43,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:43,909 INFO L229 MonitoredProcess]: Starting monitored process 85 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:25:43,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-02-21 03:25:43,911 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:25:43,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:43,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:43,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:43,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:43,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:43,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:43,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:43,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:43,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:43,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:43,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:43,933 INFO L229 MonitoredProcess]: Starting monitored process 86 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:25:43,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-02-21 03:25:43,936 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:25:43,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:43,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:43,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:43,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:43,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:43,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:43,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:43,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:43,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2022-02-21 03:25:43,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:43,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:43,958 INFO L229 MonitoredProcess]: Starting monitored process 87 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:25:43,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-02-21 03:25:43,960 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:25:43,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:43,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:43,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:43,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:43,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:43,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:43,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:43,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:43,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:43,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:43,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:43,982 INFO L229 MonitoredProcess]: Starting monitored process 88 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:25:43,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-02-21 03:25:43,984 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:25:43,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:43,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:43,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:43,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:43,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:43,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:43,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:44,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,010 INFO L229 MonitoredProcess]: Starting monitored process 89 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:25:44,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-02-21 03:25:44,012 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:25:44,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:44,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:44,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:44,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2022-02-21 03:25:44,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,036 INFO L229 MonitoredProcess]: Starting monitored process 90 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:25:44,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-02-21 03:25:44,039 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:25:44,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,046 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:25:44,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,051 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 03:25:44,051 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:25:44,060 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2022-02-21 03:25:44,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,077 INFO L229 MonitoredProcess]: Starting monitored process 91 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:25:44,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-02-21 03:25:44,079 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:25:44,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:44,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:44,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:44,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:44,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:44,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,103 INFO L229 MonitoredProcess]: Starting monitored process 92 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:25:44,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-02-21 03:25:44,106 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:25:44,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:44,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:44,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:44,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:44,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2022-02-21 03:25:44,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,138 INFO L229 MonitoredProcess]: Starting monitored process 93 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:25:44,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-02-21 03:25:44,140 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:25:44,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:44,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:44,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:44,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:44,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-02-21 03:25:44,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,164 INFO L229 MonitoredProcess]: Starting monitored process 94 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:25:44,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-02-21 03:25:44,166 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:25:44,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:44,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:44,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:44,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:44,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-02-21 03:25:44,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,190 INFO L229 MonitoredProcess]: Starting monitored process 95 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:25:44,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-02-21 03:25:44,192 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:25:44,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:44,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:44,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:44,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:44,200 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2022-02-21 03:25:44,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,216 INFO L229 MonitoredProcess]: Starting monitored process 96 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:25:44,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-02-21 03:25:44,218 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:25:44,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:44,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:44,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:44,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:44,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:44,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,242 INFO L229 MonitoredProcess]: Starting monitored process 97 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:25:44,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-02-21 03:25:44,284 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:25:44,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:44,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:44,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:44,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:44,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:44,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,308 INFO L229 MonitoredProcess]: Starting monitored process 98 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:25:44,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-02-21 03:25:44,310 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:25:44,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:44,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:44,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:44,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:44,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-02-21 03:25:44,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,333 INFO L229 MonitoredProcess]: Starting monitored process 99 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:25:44,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-02-21 03:25:44,349 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:25:44,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:44,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:44,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:44,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2022-02-21 03:25:44,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,376 INFO L229 MonitoredProcess]: Starting monitored process 100 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:25:44,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-02-21 03:25:44,378 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:25:44,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:44,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:44,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:44,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-02-21 03:25:44,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,404 INFO L229 MonitoredProcess]: Starting monitored process 101 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:25:44,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-02-21 03:25:44,405 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:25:44,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:44,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:44,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:44,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2022-02-21 03:25:44,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,430 INFO L229 MonitoredProcess]: Starting monitored process 102 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:25:44,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-02-21 03:25:44,432 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:25:44,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:44,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:44,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:44,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:44,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2022-02-21 03:25:44,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,493 INFO L229 MonitoredProcess]: Starting monitored process 103 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:25:44,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-02-21 03:25:44,495 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:25:44,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:44,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:44,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:44,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:44,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:44,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,519 INFO L229 MonitoredProcess]: Starting monitored process 104 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:25:44,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-02-21 03:25:44,521 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:25:44,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,528 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:25:44,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,533 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 03:25:44,533 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:25:44,544 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:44,554 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:25:44,554 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-02-21 03:25:44,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,556 INFO L229 MonitoredProcess]: Starting monitored process 105 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:25:44,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-02-21 03:25:44,557 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:44,564 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-02-21 03:25:44,564 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:44,564 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~n) = 1*ackermann_~n Supporting invariants [1*ackermann_~n >= 0] [2022-02-21 03:25:44,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2022-02-21 03:25:44,591 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2022-02-21 03:25:44,596 INFO L390 LassoCheck]: Loop: "assume !(0 == ~n);" "call #t~ret5 := ackermann(~m, ~n - 1);"< "~m := #in~m;~n := #in~n;" "assume !(0 == ~m);" [2022-02-21 03:25:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:44,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:44,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:44,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:44,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {5086#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5086#unseeded} is VALID [2022-02-21 03:25:44,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {5086#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {5086#unseeded} is VALID [2022-02-21 03:25:44,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {5086#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {5086#unseeded} is VALID [2022-02-21 03:25:44,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {5086#unseeded} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {5086#unseeded} is VALID [2022-02-21 03:25:44,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {5086#unseeded} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {5086#unseeded} is VALID [2022-02-21 03:25:44,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {5086#unseeded} ~m := #in~m;~n := #in~n; {5086#unseeded} is VALID [2022-02-21 03:25:44,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {5086#unseeded} assume !(0 == ~m); {5086#unseeded} is VALID [2022-02-21 03:25:44,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {5086#unseeded} assume !(0 == ~n); {5086#unseeded} is VALID [2022-02-21 03:25:44,731 INFO L272 TraceCheckUtils]: 8: Hoare triple {5086#unseeded} call #t~ret5 := ackermann(~m, ~n - 1); {5086#unseeded} is VALID [2022-02-21 03:25:44,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {5086#unseeded} ~m := #in~m;~n := #in~n; {5086#unseeded} is VALID [2022-02-21 03:25:44,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {5086#unseeded} assume !(0 == ~m); {5086#unseeded} is VALID [2022-02-21 03:25:44,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {5086#unseeded} assume 0 == ~n; {5086#unseeded} is VALID [2022-02-21 03:25:44,733 INFO L272 TraceCheckUtils]: 12: Hoare triple {5086#unseeded} call #t~ret4 := ackermann(~m - 1, 1); {5155#(and unseeded (<= 1 |ackermann_#in~n|))} is VALID [2022-02-21 03:25:44,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {5155#(and unseeded (<= 1 |ackermann_#in~n|))} ~m := #in~m;~n := #in~n; {5159#(and (<= 1 ackermann_~n) unseeded)} is VALID [2022-02-21 03:25:44,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {5159#(and (<= 1 ackermann_~n) unseeded)} assume !(0 == ~m); {5110#(and (>= ackermann_~n 0) unseeded)} is VALID [2022-02-21 03:25:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:44,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:44,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:44,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {5111#(and (>= ackermann_~n 0) (>= oldRank0 ackermann_~n))} assume !(0 == ~n); {5163#(and (>= ackermann_~n 0) (not (= ackermann_~n 0)) (>= oldRank0 ackermann_~n))} is VALID [2022-02-21 03:25:44,848 INFO L272 TraceCheckUtils]: 1: Hoare triple {5163#(and (>= ackermann_~n 0) (not (= ackermann_~n 0)) (>= oldRank0 ackermann_~n))} call #t~ret5 := ackermann(~m, ~n - 1); {5167#(and (<= (+ |ackermann_#in~n| 1) oldRank0) (<= 0 (+ |ackermann_#in~n| 1)) (not (= (+ |ackermann_#in~n| 1) 0)))} is VALID [2022-02-21 03:25:44,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {5167#(and (<= (+ |ackermann_#in~n| 1) oldRank0) (<= 0 (+ |ackermann_#in~n| 1)) (not (= (+ |ackermann_#in~n| 1) 0)))} ~m := #in~m;~n := #in~n; {5171#(and (<= 0 (+ ackermann_~n 1)) (<= (+ ackermann_~n 1) oldRank0) (not (= (+ ackermann_~n 1) 0)))} is VALID [2022-02-21 03:25:44,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {5171#(and (<= 0 (+ ackermann_~n 1)) (<= (+ ackermann_~n 1) oldRank0) (not (= (+ ackermann_~n 1) 0)))} assume !(0 == ~m); {5113#(and (>= ackermann_~n 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 ackermann_~n))))} is VALID [2022-02-21 03:25:44,849 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:25:44,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:44,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:44,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:44,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,862 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2022-02-21 03:25:44,862 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 105 transitions. cyclomatic complexity: 34 Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:44,910 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 105 transitions. cyclomatic complexity: 34. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 77 states and 106 transitions. Complement of second has 6 states. [2022-02-21 03:25:44,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:44,910 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:44,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 105 transitions. cyclomatic complexity: 34 [2022-02-21 03:25:44,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:44,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:44,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:44,911 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:44,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:44,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 106 transitions. [2022-02-21 03:25:44,911 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-02-21 03:25:44,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:44,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:44,912 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 76 states and 105 transitions. cyclomatic complexity: 34 [2022-02-21 03:25:44,916 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 17 examples of accepted words. [2022-02-21 03:25:44,916 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:44,916 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:44,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 8 transitions. cyclomatic complexity: 6 [2022-02-21 03:25:44,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:44,916 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:25:44,917 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 77 states and 106 transitions. cyclomatic complexity: 34 [2022-02-21 03:25:44,919 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 17 examples of accepted words. [2022-02-21 03:25:44,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:44,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:44,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:44,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:44,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:44,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:44,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 77 letters. Loop has 77 letters. [2022-02-21 03:25:44,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 77 letters. [2022-02-21 03:25:44,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 77 letters. Loop has 77 letters. [2022-02-21 03:25:44,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 76 letters. Loop has 76 letters. [2022-02-21 03:25:44,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 76 letters. [2022-02-21 03:25:44,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 76 letters. Loop has 76 letters. [2022-02-21 03:25:44,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:44,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:44,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:44,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:44,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:44,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:44,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:44,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:44,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:44,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:44,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:44,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:44,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:44,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:44,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:44,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:44,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:44,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:44,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:44,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:44,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:44,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:44,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:44,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:44,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:44,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:44,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:44,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:44,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:44,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:44,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:44,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:44,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:44,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:44,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:44,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:44,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:44,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:44,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:44,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:44,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:44,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:44,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:44,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:44,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:44,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:44,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:44,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:44,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:44,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:44,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:44,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:44,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:44,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:44,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:44,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:44,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:44,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:44,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:44,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:44,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:44,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:44,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:44,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:44,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:44,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:44,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:44,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:44,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:44,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:44,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:44,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:44,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:44,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:44,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:44,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:44,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:44,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:44,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:44,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:44,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:44,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:44,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:44,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:44,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:44,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:44,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:44,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:44,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:44,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:44,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:44,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:44,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:44,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:44,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:44,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:44,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:44,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:44,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:44,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:44,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:44,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:44,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:44,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:44,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:44,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,950 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-02-21 03:25:44,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:44,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:44,951 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:44,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:44,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:44,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:45,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {5086#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5086#unseeded} is VALID [2022-02-21 03:25:45,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {5086#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {5086#unseeded} is VALID [2022-02-21 03:25:45,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {5086#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {5086#unseeded} is VALID [2022-02-21 03:25:45,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {5086#unseeded} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {5086#unseeded} is VALID [2022-02-21 03:25:45,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {5086#unseeded} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {5086#unseeded} is VALID [2022-02-21 03:25:45,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {5086#unseeded} ~m := #in~m;~n := #in~n; {5086#unseeded} is VALID [2022-02-21 03:25:45,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {5086#unseeded} assume !(0 == ~m); {5086#unseeded} is VALID [2022-02-21 03:25:45,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {5086#unseeded} assume !(0 == ~n); {5086#unseeded} is VALID [2022-02-21 03:25:45,074 INFO L272 TraceCheckUtils]: 8: Hoare triple {5086#unseeded} call #t~ret5 := ackermann(~m, ~n - 1); {5086#unseeded} is VALID [2022-02-21 03:25:45,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {5086#unseeded} ~m := #in~m;~n := #in~n; {5086#unseeded} is VALID [2022-02-21 03:25:45,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {5086#unseeded} assume !(0 == ~m); {5086#unseeded} is VALID [2022-02-21 03:25:45,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {5086#unseeded} assume 0 == ~n; {5086#unseeded} is VALID [2022-02-21 03:25:45,076 INFO L272 TraceCheckUtils]: 12: Hoare triple {5086#unseeded} call #t~ret4 := ackermann(~m - 1, 1); {5302#(and unseeded (<= 1 |ackermann_#in~n|))} is VALID [2022-02-21 03:25:45,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {5302#(and unseeded (<= 1 |ackermann_#in~n|))} ~m := #in~m;~n := #in~n; {5306#(and (<= 1 ackermann_~n) unseeded)} is VALID [2022-02-21 03:25:45,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {5306#(and (<= 1 ackermann_~n) unseeded)} assume !(0 == ~m); {5110#(and (>= ackermann_~n 0) unseeded)} is VALID [2022-02-21 03:25:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:45,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:45,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {5111#(and (>= ackermann_~n 0) (>= oldRank0 ackermann_~n))} assume !(0 == ~n); {5310#(and (>= ackermann_~n 0) (not (= ackermann_~n 0)) (>= oldRank0 ackermann_~n))} is VALID [2022-02-21 03:25:45,217 INFO L272 TraceCheckUtils]: 1: Hoare triple {5310#(and (>= ackermann_~n 0) (not (= ackermann_~n 0)) (>= oldRank0 ackermann_~n))} call #t~ret5 := ackermann(~m, ~n - 1); {5314#(and (<= (+ |ackermann_#in~n| 1) oldRank0) (<= 0 (+ |ackermann_#in~n| 1)) (not (= (+ |ackermann_#in~n| 1) 0)))} is VALID [2022-02-21 03:25:45,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {5314#(and (<= (+ |ackermann_#in~n| 1) oldRank0) (<= 0 (+ |ackermann_#in~n| 1)) (not (= (+ |ackermann_#in~n| 1) 0)))} ~m := #in~m;~n := #in~n; {5318#(and (<= 0 (+ ackermann_~n 1)) (<= (+ ackermann_~n 1) oldRank0) (not (= (+ ackermann_~n 1) 0)))} is VALID [2022-02-21 03:25:45,218 INFO L290 TraceCheckUtils]: 3: Hoare triple {5318#(and (<= 0 (+ ackermann_~n 1)) (<= (+ ackermann_~n 1) oldRank0) (not (= (+ ackermann_~n 1) 0)))} assume !(0 == ~m); {5113#(and (>= ackermann_~n 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 ackermann_~n))))} is VALID [2022-02-21 03:25:45,218 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:25:45,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:45,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:45,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,228 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 4 loop predicates [2022-02-21 03:25:45,229 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 105 transitions. cyclomatic complexity: 34 Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:45,266 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 105 transitions. cyclomatic complexity: 34. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 77 states and 106 transitions. Complement of second has 6 states. [2022-02-21 03:25:45,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:45,266 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:45,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 105 transitions. cyclomatic complexity: 34 [2022-02-21 03:25:45,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:45,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:45,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:45,267 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:45,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:45,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 106 transitions. [2022-02-21 03:25:45,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-02-21 03:25:45,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:45,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:45,268 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 76 states and 105 transitions. cyclomatic complexity: 34 [2022-02-21 03:25:45,268 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 17 examples of accepted words. [2022-02-21 03:25:45,268 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:45,269 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:45,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 8 transitions. cyclomatic complexity: 6 [2022-02-21 03:25:45,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:45,269 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:25:45,269 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 77 states and 106 transitions. cyclomatic complexity: 34 [2022-02-21 03:25:45,272 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 17 examples of accepted words. [2022-02-21 03:25:45,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 77 letters. Loop has 77 letters. [2022-02-21 03:25:45,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 77 letters. [2022-02-21 03:25:45,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 77 letters. Loop has 77 letters. [2022-02-21 03:25:45,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 76 letters. Loop has 76 letters. [2022-02-21 03:25:45,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 76 letters. [2022-02-21 03:25:45,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 76 letters. Loop has 76 letters. [2022-02-21 03:25:45,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:45,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:45,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:45,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:45,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:45,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:45,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:45,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:45,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:45,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:45,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:45,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:45,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:45,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:45,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:45,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:45,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:45,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:45,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:45,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:45,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:45,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:45,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:45,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:45,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:45,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:45,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:45,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:45,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:45,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:45,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:45,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:45,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:45,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:45,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:45,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:45,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:45,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:45,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:45,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:45,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:45,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:45,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:45,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:45,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:45,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:45,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:45,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:45,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:45,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:45,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:45,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:45,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:45,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:45,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:45,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:45,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:45,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:45,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:45,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:45,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:45,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:45,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:45,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:45,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:45,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:45,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:45,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:45,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:45,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:45,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:45,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:45,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:45,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:45,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:45,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:45,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:45,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:45,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:45,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:45,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:45,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:45,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:45,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:45,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:45,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:45,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 106 transitions. cyclomatic complexity: 34 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:45,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,302 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-02-21 03:25:45,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,303 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:45,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:45,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {5086#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5086#unseeded} is VALID [2022-02-21 03:25:45,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {5086#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {5086#unseeded} is VALID [2022-02-21 03:25:45,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {5086#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {5086#unseeded} is VALID [2022-02-21 03:25:45,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {5086#unseeded} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {5086#unseeded} is VALID [2022-02-21 03:25:45,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {5086#unseeded} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {5086#unseeded} is VALID [2022-02-21 03:25:45,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {5086#unseeded} ~m := #in~m;~n := #in~n; {5086#unseeded} is VALID [2022-02-21 03:25:45,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {5086#unseeded} assume !(0 == ~m); {5086#unseeded} is VALID [2022-02-21 03:25:45,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {5086#unseeded} assume !(0 == ~n); {5086#unseeded} is VALID [2022-02-21 03:25:45,407 INFO L272 TraceCheckUtils]: 8: Hoare triple {5086#unseeded} call #t~ret5 := ackermann(~m, ~n - 1); {5086#unseeded} is VALID [2022-02-21 03:25:45,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {5086#unseeded} ~m := #in~m;~n := #in~n; {5086#unseeded} is VALID [2022-02-21 03:25:45,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {5086#unseeded} assume !(0 == ~m); {5086#unseeded} is VALID [2022-02-21 03:25:45,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {5086#unseeded} assume 0 == ~n; {5086#unseeded} is VALID [2022-02-21 03:25:45,408 INFO L272 TraceCheckUtils]: 12: Hoare triple {5086#unseeded} call #t~ret4 := ackermann(~m - 1, 1); {5449#(and unseeded (<= 1 |ackermann_#in~n|))} is VALID [2022-02-21 03:25:45,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {5449#(and unseeded (<= 1 |ackermann_#in~n|))} ~m := #in~m;~n := #in~n; {5453#(and (<= 1 ackermann_~n) unseeded)} is VALID [2022-02-21 03:25:45,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {5453#(and (<= 1 ackermann_~n) unseeded)} assume !(0 == ~m); {5110#(and (>= ackermann_~n 0) unseeded)} is VALID [2022-02-21 03:25:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:45,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {5111#(and (>= ackermann_~n 0) (>= oldRank0 ackermann_~n))} assume !(0 == ~n); {5457#(and (>= ackermann_~n 0) (not (= ackermann_~n 0)) (>= oldRank0 ackermann_~n))} is VALID [2022-02-21 03:25:45,538 INFO L272 TraceCheckUtils]: 1: Hoare triple {5457#(and (>= ackermann_~n 0) (not (= ackermann_~n 0)) (>= oldRank0 ackermann_~n))} call #t~ret5 := ackermann(~m, ~n - 1); {5461#(and (<= (+ |ackermann_#in~n| 1) oldRank0) (<= 0 (+ |ackermann_#in~n| 1)) (not (= (+ |ackermann_#in~n| 1) 0)))} is VALID [2022-02-21 03:25:45,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {5461#(and (<= (+ |ackermann_#in~n| 1) oldRank0) (<= 0 (+ |ackermann_#in~n| 1)) (not (= (+ |ackermann_#in~n| 1) 0)))} ~m := #in~m;~n := #in~n; {5465#(and (<= 0 (+ ackermann_~n 1)) (<= (+ ackermann_~n 1) oldRank0) (not (= (+ ackermann_~n 1) 0)))} is VALID [2022-02-21 03:25:45,539 INFO L290 TraceCheckUtils]: 3: Hoare triple {5465#(and (<= 0 (+ ackermann_~n 1)) (<= (+ ackermann_~n 1) oldRank0) (not (= (+ ackermann_~n 1) 0)))} assume !(0 == ~m); {5113#(and (>= ackermann_~n 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 ackermann_~n))))} is VALID [2022-02-21 03:25:45,539 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:25:45,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:45,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:45,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,548 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2022-02-21 03:25:45,548 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 105 transitions. cyclomatic complexity: 34 Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:45,725 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 105 transitions. cyclomatic complexity: 34. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 171 states and 230 transitions. Complement of second has 38 states. [2022-02-21 03:25:45,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 2 accepting loop states [2022-02-21 03:25:45,726 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:45,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 105 transitions. cyclomatic complexity: 34 [2022-02-21 03:25:45,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:45,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:45,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:45,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:45,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:45,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:45,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 230 transitions. [2022-02-21 03:25:45,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-02-21 03:25:45,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:45,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:45,729 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 76 states and 105 transitions. cyclomatic complexity: 34 [2022-02-21 03:25:45,729 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 17 examples of accepted words. [2022-02-21 03:25:45,730 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:45,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:45,730 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:45,731 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 171 states and 230 transitions. cyclomatic complexity: 64 [2022-02-21 03:25:45,734 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2022-02-21 03:25:45,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:45,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:45,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:45,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:45,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:45,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:45,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 171 letters. Loop has 171 letters. [2022-02-21 03:25:45,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 171 letters. Loop has 171 letters. [2022-02-21 03:25:45,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 171 letters. Loop has 171 letters. [2022-02-21 03:25:45,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 76 letters. Loop has 76 letters. [2022-02-21 03:25:45,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 76 letters. [2022-02-21 03:25:45,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 76 letters. Loop has 76 letters. [2022-02-21 03:25:45,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:25:45,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 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:25:45,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:25:45,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:45,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:45,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:45,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:45,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:45,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:45,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:45,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:45,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:45,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:45,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:45,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:45,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:45,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:45,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 28 letters. Loop has 8 letters. [2022-02-21 03:25:45,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:45,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:45,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 24 letters. Loop has 8 letters. [2022-02-21 03:25:45,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:45,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:45,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:45,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:45,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:45,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:45,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:45,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:45,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:45,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:45,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:45,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:45,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:45,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:45,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:45,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 48 letters. Loop has 32 letters. [2022-02-21 03:25:45,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:45,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:45,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:25:45,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:45,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:45,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:45,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:45,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:45,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:45,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:45,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:45,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:45,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:45,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:45,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:45,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:45,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:45,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:45,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:45,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:45,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:45,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:45,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:45,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:45,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 25 letters. Loop has 20 letters. [2022-02-21 03:25:45,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 20 letters. [2022-02-21 03:25:45,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 25 letters. Loop has 20 letters. [2022-02-21 03:25:45,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 26 letters. Loop has 20 letters. [2022-02-21 03:25:45,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 20 letters. [2022-02-21 03:25:45,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 26 letters. Loop has 20 letters. [2022-02-21 03:25:45,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 27 letters. Loop has 20 letters. [2022-02-21 03:25:45,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 20 letters. [2022-02-21 03:25:45,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 27 letters. Loop has 20 letters. [2022-02-21 03:25:45,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:25:45,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:25:45,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:25:45,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:45,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:45,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:45,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:45,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:45,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:45,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:45,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:45,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:45,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:45,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:45,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:45,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:25:45,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:25:45,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 36 letters. Loop has 12 letters. [2022-02-21 03:25:45,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:45,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:45,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:45,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 52 letters. Loop has 48 letters. [2022-02-21 03:25:45,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 48 letters. [2022-02-21 03:25:45,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 52 letters. Loop has 48 letters. [2022-02-21 03:25:45,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 40 letters. [2022-02-21 03:25:45,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 40 letters. [2022-02-21 03:25:45,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 20 letters. Loop has 40 letters. [2022-02-21 03:25:45,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:45,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:45,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:45,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:45,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:45,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:45,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 105 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:45,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:45,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 171 states and 230 transitions. cyclomatic complexity: 64 Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:45,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,771 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-02-21 03:25:45,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:45,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:25:45,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:25:45,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 230 transitions. cyclomatic complexity: 64 [2022-02-21 03:25:45,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-02-21 03:25:45,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 113 states and 162 transitions. [2022-02-21 03:25:45,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2022-02-21 03:25:45,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2022-02-21 03:25:45,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 162 transitions. [2022-02-21 03:25:45,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:45,792 INFO L681 BuchiCegarLoop]: Abstraction has 113 states and 162 transitions. [2022-02-21 03:25:45,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 162 transitions. [2022-02-21 03:25:45,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-02-21 03:25:45,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:45,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states and 162 transitions. Second operand has 108 states, 76 states have (on average 1.131578947368421) internal successors, (86), 79 states have internal predecessors, (86), 22 states have call successors, (29), 17 states have call predecessors, (29), 10 states have return successors, (35), 11 states have call predecessors, (35), 20 states have call successors, (35) [2022-02-21 03:25:45,797 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states and 162 transitions. Second operand has 108 states, 76 states have (on average 1.131578947368421) internal successors, (86), 79 states have internal predecessors, (86), 22 states have call successors, (29), 17 states have call predecessors, (29), 10 states have return successors, (35), 11 states have call predecessors, (35), 20 states have call successors, (35) [2022-02-21 03:25:45,798 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 108 states, 76 states have (on average 1.131578947368421) internal successors, (86), 79 states have internal predecessors, (86), 22 states have call successors, (29), 17 states have call predecessors, (29), 10 states have return successors, (35), 11 states have call predecessors, (35), 20 states have call successors, (35) [2022-02-21 03:25:45,798 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:45,807 INFO L93 Difference]: Finished difference Result 279 states and 380 transitions. [2022-02-21 03:25:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 380 transitions. [2022-02-21 03:25:45,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:45,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:45,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 76 states have (on average 1.131578947368421) internal successors, (86), 79 states have internal predecessors, (86), 22 states have call successors, (29), 17 states have call predecessors, (29), 10 states have return successors, (35), 11 states have call predecessors, (35), 20 states have call successors, (35) Second operand 113 states and 162 transitions. [2022-02-21 03:25:45,810 INFO L87 Difference]: Start difference. First operand has 108 states, 76 states have (on average 1.131578947368421) internal successors, (86), 79 states have internal predecessors, (86), 22 states have call successors, (29), 17 states have call predecessors, (29), 10 states have return successors, (35), 11 states have call predecessors, (35), 20 states have call successors, (35) Second operand 113 states and 162 transitions. [2022-02-21 03:25:45,810 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:45,821 INFO L93 Difference]: Finished difference Result 315 states and 426 transitions. [2022-02-21 03:25:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 426 transitions. [2022-02-21 03:25:45,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:45,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:45,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:45,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 76 states have (on average 1.131578947368421) internal successors, (86), 79 states have internal predecessors, (86), 22 states have call successors, (29), 17 states have call predecessors, (29), 10 states have return successors, (35), 11 states have call predecessors, (35), 20 states have call successors, (35) [2022-02-21 03:25:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2022-02-21 03:25:45,826 INFO L704 BuchiCegarLoop]: Abstraction has 108 states and 150 transitions. [2022-02-21 03:25:45,826 INFO L587 BuchiCegarLoop]: Abstraction has 108 states and 150 transitions. [2022-02-21 03:25:45,826 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:25:45,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 150 transitions. [2022-02-21 03:25:45,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2022-02-21 03:25:45,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:45,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:45,827 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:45,827 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:45,828 INFO L791 eck$LassoCheckResult]: Stem: 5689#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 5690#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 5700#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 5701#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 5702#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 5703#ackermannENTRY ~m := #in~m;~n := #in~n; 5707#L17 assume !(0 == ~m); 5708#L20 assume !(0 == ~n); 5725#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 5751#ackermannENTRY ~m := #in~m;~n := #in~n; 5779#L17 assume !(0 == ~m); 5777#L20 assume 0 == ~n; 5692#L21 call #t~ret4 := ackermann(~m - 1, 1);< 5691#ackermannENTRY ~m := #in~m;~n := #in~n; 5695#L17 assume 0 == ~m;#res := 1 + ~n; 5698#ackermannFINAL assume true; 5699#ackermannEXIT >#43#return; 5704#L21-1 #res := #t~ret4;havoc #t~ret4; 5726#ackermannFINAL assume true; 5747#ackermannEXIT >#45#return; 5732#L23-1 [2022-02-21 03:25:45,828 INFO L793 eck$LassoCheckResult]: Loop: 5732#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 5733#ackermannENTRY ~m := #in~m;~n := #in~n; 5772#L17 assume !(0 == ~m); 5735#L20 assume !(0 == ~n); 5729#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 5733#ackermannENTRY ~m := #in~m;~n := #in~n; 5772#L17 assume !(0 == ~m); 5735#L20 assume 0 == ~n; 5715#L21 call #t~ret4 := ackermann(~m - 1, 1);< 5722#ackermannENTRY ~m := #in~m;~n := #in~n; 5768#L17 assume 0 == ~m;#res := 1 + ~n; 5767#ackermannFINAL assume true; 5758#ackermannEXIT >#43#return; 5755#L21-1 #res := #t~ret4;havoc #t~ret4; 5753#ackermannFINAL assume true; 5740#ackermannEXIT >#45#return; 5732#L23-1 [2022-02-21 03:25:45,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:45,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2142297082, now seen corresponding path program 1 times [2022-02-21 03:25:45,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:45,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756259823] [2022-02-21 03:25:45,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:45,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:45,838 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:45,846 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:45,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:45,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1250092377, now seen corresponding path program 1 times [2022-02-21 03:25:45,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:45,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817106862] [2022-02-21 03:25:45,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:45,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:45,851 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:45,856 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:45,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1017421986, now seen corresponding path program 1 times [2022-02-21 03:25:45,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:45,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215911223] [2022-02-21 03:25:45,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:45,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:25:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6986#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:25:45,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {6986#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {6987#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:25:45,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {6987#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {6987#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:25:45,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6987#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {6953#true} #43#return; {6984#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:25:45,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6953#true} is VALID [2022-02-21 03:25:45,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {6953#true} assume !(0 == ~m); {6953#true} is VALID [2022-02-21 03:25:45,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {6953#true} assume 0 == ~n; {6953#true} is VALID [2022-02-21 03:25:45,969 INFO L272 TraceCheckUtils]: 3: Hoare triple {6953#true} call #t~ret4 := ackermann(~m - 1, 1); {6953#true} is VALID [2022-02-21 03:25:45,969 INFO L290 TraceCheckUtils]: 4: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6986#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:25:45,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {6986#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {6987#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:25:45,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {6987#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {6987#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:25:45,971 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6987#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {6953#true} #43#return; {6984#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:25:45,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {6984#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {6985#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:25:45,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {6985#(<= 2 |ackermann_#res|)} assume true; {6985#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:25:45,973 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6985#(<= 2 |ackermann_#res|)} {6953#true} #45#return; {6966#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:25:45,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-21 03:25:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:46,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:46,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6953#true} is VALID [2022-02-21 03:25:46,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {6953#true} assume 0 == ~m;#res := 1 + ~n; {6953#true} is VALID [2022-02-21 03:25:46,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {6953#true} assume true; {6953#true} is VALID [2022-02-21 03:25:46,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6953#true} {6989#(= |ackermann_#in~n| 0)} #43#return; {6989#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6988#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:46,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {6988#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {6988#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:46,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {6988#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {6989#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,009 INFO L272 TraceCheckUtils]: 3: Hoare triple {6989#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {6953#true} is VALID [2022-02-21 03:25:46,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6953#true} is VALID [2022-02-21 03:25:46,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {6953#true} assume 0 == ~m;#res := 1 + ~n; {6953#true} is VALID [2022-02-21 03:25:46,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {6953#true} assume true; {6953#true} is VALID [2022-02-21 03:25:46,010 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6953#true} {6989#(= |ackermann_#in~n| 0)} #43#return; {6989#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {6989#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {6989#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {6989#(= |ackermann_#in~n| 0)} assume true; {6989#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,012 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6989#(= |ackermann_#in~n| 0)} {6968#(<= 2 ackermann_~n)} #45#return; {6954#false} is VALID [2022-02-21 03:25:46,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {6953#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6953#true} is VALID [2022-02-21 03:25:46,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {6953#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {6953#true} is VALID [2022-02-21 03:25:46,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {6953#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {6953#true} is VALID [2022-02-21 03:25:46,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {6953#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {6953#true} is VALID [2022-02-21 03:25:46,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {6953#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {6953#true} is VALID [2022-02-21 03:25:46,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6953#true} is VALID [2022-02-21 03:25:46,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {6953#true} assume !(0 == ~m); {6953#true} is VALID [2022-02-21 03:25:46,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {6953#true} assume !(0 == ~n); {6953#true} is VALID [2022-02-21 03:25:46,016 INFO L272 TraceCheckUtils]: 8: Hoare triple {6953#true} call #t~ret5 := ackermann(~m, ~n - 1); {6953#true} is VALID [2022-02-21 03:25:46,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6953#true} is VALID [2022-02-21 03:25:46,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {6953#true} assume !(0 == ~m); {6953#true} is VALID [2022-02-21 03:25:46,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {6953#true} assume 0 == ~n; {6953#true} is VALID [2022-02-21 03:25:46,017 INFO L272 TraceCheckUtils]: 12: Hoare triple {6953#true} call #t~ret4 := ackermann(~m - 1, 1); {6953#true} is VALID [2022-02-21 03:25:46,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6986#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:25:46,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {6986#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {6987#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:25:46,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {6987#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {6987#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:25:46,019 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6987#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {6953#true} #43#return; {6984#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:25:46,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {6984#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {6985#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:25:46,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {6985#(<= 2 |ackermann_#res|)} assume true; {6985#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:25:46,020 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6985#(<= 2 |ackermann_#res|)} {6953#true} #45#return; {6966#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:25:46,021 INFO L272 TraceCheckUtils]: 20: Hoare triple {6966#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {6967#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:46,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {6967#(<= 2 |ackermann_#in~n|)} ~m := #in~m;~n := #in~n; {6968#(<= 2 ackermann_~n)} is VALID [2022-02-21 03:25:46,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {6968#(<= 2 ackermann_~n)} assume !(0 == ~m); {6968#(<= 2 ackermann_~n)} is VALID [2022-02-21 03:25:46,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {6968#(<= 2 ackermann_~n)} assume !(0 == ~n); {6968#(<= 2 ackermann_~n)} is VALID [2022-02-21 03:25:46,022 INFO L272 TraceCheckUtils]: 24: Hoare triple {6968#(<= 2 ackermann_~n)} call #t~ret5 := ackermann(~m, ~n - 1); {6953#true} is VALID [2022-02-21 03:25:46,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6988#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:46,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {6988#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {6988#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:46,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {6988#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {6989#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,024 INFO L272 TraceCheckUtils]: 28: Hoare triple {6989#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {6953#true} is VALID [2022-02-21 03:25:46,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6953#true} is VALID [2022-02-21 03:25:46,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {6953#true} assume 0 == ~m;#res := 1 + ~n; {6953#true} is VALID [2022-02-21 03:25:46,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {6953#true} assume true; {6953#true} is VALID [2022-02-21 03:25:46,025 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6953#true} {6989#(= |ackermann_#in~n| 0)} #43#return; {6989#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,025 INFO L290 TraceCheckUtils]: 33: Hoare triple {6989#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {6989#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,026 INFO L290 TraceCheckUtils]: 34: Hoare triple {6989#(= |ackermann_#in~n| 0)} assume true; {6989#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,026 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6989#(= |ackermann_#in~n| 0)} {6968#(<= 2 ackermann_~n)} #45#return; {6954#false} is VALID [2022-02-21 03:25:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:25:46,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:46,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215911223] [2022-02-21 03:25:46,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215911223] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:25:46,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087016778] [2022-02-21 03:25:46,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:46,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:25:46,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:46,032 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:25:46,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-02-21 03:25:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:46,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:25:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:46,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:46,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {6953#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6953#true} is VALID [2022-02-21 03:25:46,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {6953#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {6953#true} is VALID [2022-02-21 03:25:46,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {6953#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {6953#true} is VALID [2022-02-21 03:25:46,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {6953#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {6953#true} is VALID [2022-02-21 03:25:46,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {6953#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {6953#true} is VALID [2022-02-21 03:25:46,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6953#true} is VALID [2022-02-21 03:25:46,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {6953#true} assume !(0 == ~m); {6953#true} is VALID [2022-02-21 03:25:46,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {6953#true} assume !(0 == ~n); {6953#true} is VALID [2022-02-21 03:25:46,299 INFO L272 TraceCheckUtils]: 8: Hoare triple {6953#true} call #t~ret5 := ackermann(~m, ~n - 1); {6953#true} is VALID [2022-02-21 03:25:46,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6953#true} is VALID [2022-02-21 03:25:46,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {6953#true} assume !(0 == ~m); {6953#true} is VALID [2022-02-21 03:25:46,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {6953#true} assume 0 == ~n; {6953#true} is VALID [2022-02-21 03:25:46,300 INFO L272 TraceCheckUtils]: 12: Hoare triple {6953#true} call #t~ret4 := ackermann(~m - 1, 1); {6953#true} is VALID [2022-02-21 03:25:46,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {7036#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:25:46,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {7036#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {7040#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:25:46,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {7040#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {7040#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:25:46,303 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7040#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {6953#true} #43#return; {6984#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:25:46,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {6984#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {6985#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:25:46,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {6985#(<= 2 |ackermann_#res|)} assume true; {6985#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:25:46,305 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6985#(<= 2 |ackermann_#res|)} {6953#true} #45#return; {6966#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:25:46,306 INFO L272 TraceCheckUtils]: 20: Hoare triple {6966#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {6967#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:46,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {6967#(<= 2 |ackermann_#in~n|)} ~m := #in~m;~n := #in~n; {6968#(<= 2 ackermann_~n)} is VALID [2022-02-21 03:25:46,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {6968#(<= 2 ackermann_~n)} assume !(0 == ~m); {6968#(<= 2 ackermann_~n)} is VALID [2022-02-21 03:25:46,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {6968#(<= 2 ackermann_~n)} assume !(0 == ~n); {6968#(<= 2 ackermann_~n)} is VALID [2022-02-21 03:25:46,309 INFO L272 TraceCheckUtils]: 24: Hoare triple {6968#(<= 2 ackermann_~n)} call #t~ret5 := ackermann(~m, ~n - 1); {6953#true} is VALID [2022-02-21 03:25:46,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {7036#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:25:46,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {7036#(<= |ackermann_#in~n| ackermann_~n)} assume !(0 == ~m); {7036#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:25:46,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {7036#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~n; {7080#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,312 INFO L272 TraceCheckUtils]: 28: Hoare triple {7080#(<= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {6953#true} is VALID [2022-02-21 03:25:46,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6953#true} is VALID [2022-02-21 03:25:46,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {6953#true} assume 0 == ~m;#res := 1 + ~n; {6953#true} is VALID [2022-02-21 03:25:46,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {6953#true} assume true; {6953#true} is VALID [2022-02-21 03:25:46,313 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6953#true} {7080#(<= |ackermann_#in~n| 0)} #43#return; {7080#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {7080#(<= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {7080#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {7080#(<= |ackermann_#in~n| 0)} assume true; {7080#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,315 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {7080#(<= |ackermann_#in~n| 0)} {6968#(<= 2 ackermann_~n)} #45#return; {6954#false} is VALID [2022-02-21 03:25:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-21 03:25:46,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:25:46,978 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {7080#(<= |ackermann_#in~n| 0)} {6968#(<= 2 ackermann_~n)} #45#return; {6954#false} is VALID [2022-02-21 03:25:46,979 INFO L290 TraceCheckUtils]: 34: Hoare triple {7080#(<= |ackermann_#in~n| 0)} assume true; {7080#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {7080#(<= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {7080#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,980 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6953#true} {7080#(<= |ackermann_#in~n| 0)} #43#return; {7080#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {6953#true} assume true; {6953#true} is VALID [2022-02-21 03:25:46,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {6953#true} assume 0 == ~m;#res := 1 + ~n; {6953#true} is VALID [2022-02-21 03:25:46,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6953#true} is VALID [2022-02-21 03:25:46,981 INFO L272 TraceCheckUtils]: 28: Hoare triple {7080#(<= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {6953#true} is VALID [2022-02-21 03:25:46,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {7132#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} assume 0 == ~n; {7080#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:46,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {7132#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} assume !(0 == ~m); {7132#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} is VALID [2022-02-21 03:25:46,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {7132#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} is VALID [2022-02-21 03:25:46,983 INFO L272 TraceCheckUtils]: 24: Hoare triple {6968#(<= 2 ackermann_~n)} call #t~ret5 := ackermann(~m, ~n - 1); {6953#true} is VALID [2022-02-21 03:25:46,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {6968#(<= 2 ackermann_~n)} assume !(0 == ~n); {6968#(<= 2 ackermann_~n)} is VALID [2022-02-21 03:25:46,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {6968#(<= 2 ackermann_~n)} assume !(0 == ~m); {6968#(<= 2 ackermann_~n)} is VALID [2022-02-21 03:25:46,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {6967#(<= 2 |ackermann_#in~n|)} ~m := #in~m;~n := #in~n; {6968#(<= 2 ackermann_~n)} is VALID [2022-02-21 03:25:46,985 INFO L272 TraceCheckUtils]: 20: Hoare triple {6966#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {6967#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:46,986 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6985#(<= 2 |ackermann_#res|)} {6953#true} #45#return; {6966#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:25:46,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {6985#(<= 2 |ackermann_#res|)} assume true; {6985#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:25:46,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {6984#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {6985#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:25:46,988 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7169#(or (not (<= 1 |ackermann_#in~n|)) (<= 2 |ackermann_#res|))} {6953#true} #43#return; {6984#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:25:46,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {7169#(or (not (<= 1 |ackermann_#in~n|)) (<= 2 |ackermann_#res|))} assume true; {7169#(or (not (<= 1 |ackermann_#in~n|)) (<= 2 |ackermann_#res|))} is VALID [2022-02-21 03:25:46,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {7132#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} assume 0 == ~m;#res := 1 + ~n; {7169#(or (not (<= 1 |ackermann_#in~n|)) (<= 2 |ackermann_#res|))} is VALID [2022-02-21 03:25:46,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {7132#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} is VALID [2022-02-21 03:25:46,989 INFO L272 TraceCheckUtils]: 12: Hoare triple {6953#true} call #t~ret4 := ackermann(~m - 1, 1); {6953#true} is VALID [2022-02-21 03:25:46,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {6953#true} assume 0 == ~n; {6953#true} is VALID [2022-02-21 03:25:46,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {6953#true} assume !(0 == ~m); {6953#true} is VALID [2022-02-21 03:25:46,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6953#true} is VALID [2022-02-21 03:25:46,990 INFO L272 TraceCheckUtils]: 8: Hoare triple {6953#true} call #t~ret5 := ackermann(~m, ~n - 1); {6953#true} is VALID [2022-02-21 03:25:46,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {6953#true} assume !(0 == ~n); {6953#true} is VALID [2022-02-21 03:25:46,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {6953#true} assume !(0 == ~m); {6953#true} is VALID [2022-02-21 03:25:46,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {6953#true} ~m := #in~m;~n := #in~n; {6953#true} is VALID [2022-02-21 03:25:46,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {6953#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {6953#true} is VALID [2022-02-21 03:25:46,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {6953#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {6953#true} is VALID [2022-02-21 03:25:46,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {6953#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {6953#true} is VALID [2022-02-21 03:25:46,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {6953#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {6953#true} is VALID [2022-02-21 03:25:46,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {6953#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6953#true} is VALID [2022-02-21 03:25:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-21 03:25:46,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087016778] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:25:46,992 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:25:46,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-02-21 03:25:46,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808131070] [2022-02-21 03:25:46,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:25:47,288 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:47,288 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:47,289 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:47,289 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:47,289 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:47,289 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:47,289 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:47,289 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:47,289 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration7_Loop [2022-02-21 03:25:47,289 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:47,289 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:47,290 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:25:47,293 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:25:47,295 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:25:47,297 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:25:47,305 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:25:47,381 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:47,382 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:47,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:47,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:47,384 INFO L229 MonitoredProcess]: Starting monitored process 107 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:25:47,391 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:47,392 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:47,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-02-21 03:25:47,407 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:47,408 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:47,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:47,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:47,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:47,431 INFO L229 MonitoredProcess]: Starting monitored process 108 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:25:47,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:47,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:47,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-02-21 03:25:47,452 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:47,452 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:47,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:47,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:47,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:47,477 INFO L229 MonitoredProcess]: Starting monitored process 109 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:25:47,484 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:47,484 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:47,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-02-21 03:25:47,505 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:47,505 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:47,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2022-02-21 03:25:47,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:47,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:47,526 INFO L229 MonitoredProcess]: Starting monitored process 110 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:25:47,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-02-21 03:25:47,528 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:47,528 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:47,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-02-21 03:25:47,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:47,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:47,550 INFO L229 MonitoredProcess]: Starting monitored process 111 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:25:47,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-02-21 03:25:47,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:47,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:49,223 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:49,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:49,227 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:49,227 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:49,227 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:49,227 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:49,227 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:49,227 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:49,227 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:49,227 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:49,227 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration7_Loop [2022-02-21 03:25:49,227 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:49,227 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:49,228 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:25:49,229 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:25:49,231 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:25:49,232 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:25:49,244 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:25:49,313 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:49,314 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:49,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:49,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:49,315 INFO L229 MonitoredProcess]: Starting monitored process 112 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:25:49,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-02-21 03:25:49,319 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:25:49,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:49,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:49,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:49,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:49,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:49,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:49,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:49,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:49,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-02-21 03:25:49,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:49,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:49,342 INFO L229 MonitoredProcess]: Starting monitored process 113 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:25:49,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-02-21 03:25:49,353 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:25:49,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:49,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:49,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:49,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:49,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:49,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:49,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:49,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:49,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:49,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:49,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:49,375 INFO L229 MonitoredProcess]: Starting monitored process 114 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:25:49,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-02-21 03:25:49,377 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:25:49,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:49,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:49,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:49,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:49,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:49,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:49,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:49,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:49,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2022-02-21 03:25:49,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:49,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:49,400 INFO L229 MonitoredProcess]: Starting monitored process 115 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:25:49,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-02-21 03:25:49,401 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:25:49,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:49,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:49,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:49,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:49,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:49,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:49,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:49,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:49,412 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:49,412 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:25:49,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:49,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:49,413 INFO L229 MonitoredProcess]: Starting monitored process 116 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:25:49,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-02-21 03:25:49,414 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:49,414 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:49,415 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:49,415 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~m) = 1*ackermann_~m Supporting invariants [] [2022-02-21 03:25:49,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:49,433 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:49,435 INFO L390 LassoCheck]: Loop: "call #t~ret6 := ackermann(~m - 1, #t~ret5);"< "~m := #in~m;~n := #in~n;" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret5 := ackermann(~m, ~n - 1);"< "~m := #in~m;~n := #in~n;" "assume !(0 == ~m);" "assume 0 == ~n;" "call #t~ret4 := ackermann(~m - 1, 1);"< "~m := #in~m;~n := #in~n;" "assume 0 == ~m;#res := 1 + ~n;" "assume true;" >"#43#return;" "#res := #t~ret4;havoc #t~ret4;" "assume true;" >"#45#return;" [2022-02-21 03:25:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:49,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:49,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:25:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:49,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:49,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {7209#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7209#unseeded} is VALID [2022-02-21 03:25:49,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {7209#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {7209#unseeded} is VALID [2022-02-21 03:25:49,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {7209#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {7209#unseeded} is VALID [2022-02-21 03:25:49,633 INFO L290 TraceCheckUtils]: 3: Hoare triple {7209#unseeded} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {7209#unseeded} is VALID [2022-02-21 03:25:49,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {7209#unseeded} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {7209#unseeded} is VALID [2022-02-21 03:25:49,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {7209#unseeded} ~m := #in~m;~n := #in~n; {7209#unseeded} is VALID [2022-02-21 03:25:49,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {7209#unseeded} assume !(0 == ~m); {7209#unseeded} is VALID [2022-02-21 03:25:49,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {7209#unseeded} assume !(0 == ~n); {7209#unseeded} is VALID [2022-02-21 03:25:49,635 INFO L272 TraceCheckUtils]: 8: Hoare triple {7209#unseeded} call #t~ret5 := ackermann(~m, ~n - 1); {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:49,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:49,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~m); {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:49,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~n; {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:49,638 INFO L272 TraceCheckUtils]: 12: Hoare triple {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := ackermann(~m - 1, 1); {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:49,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:49,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~m;#res := 1 + ~n; {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:49,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:49,640 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #43#return; {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:49,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4;havoc #t~ret4; {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:49,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:49,642 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7251#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7209#unseeded} #45#return; {7209#unseeded} is VALID [2022-02-21 03:25:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:49,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 03:25:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:49,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:49,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {7212#(>= oldRank0 ackermann_~m)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {7285#(<= (+ |ackermann_#in~m| 1) oldRank0)} is VALID [2022-02-21 03:25:49,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {7285#(<= (+ |ackermann_#in~m| 1) oldRank0)} ~m := #in~m;~n := #in~n; {7289#(<= (+ ackermann_~m 1) oldRank0)} is VALID [2022-02-21 03:25:49,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {7289#(<= (+ ackermann_~m 1) oldRank0)} assume !(0 == ~m); {7289#(<= (+ ackermann_~m 1) oldRank0)} is VALID [2022-02-21 03:25:49,895 INFO L290 TraceCheckUtils]: 3: Hoare triple {7289#(<= (+ ackermann_~m 1) oldRank0)} assume !(0 == ~n); {7289#(<= (+ ackermann_~m 1) oldRank0)} is VALID [2022-02-21 03:25:49,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {7289#(<= (+ ackermann_~m 1) oldRank0)} call #t~ret5 := ackermann(~m, ~n - 1); {7299#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:49,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {7299#(<= |old(oldRank0)| oldRank0)} ~m := #in~m;~n := #in~n; {7303#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:49,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {7303#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} assume !(0 == ~m); {7303#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:49,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {7303#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} assume 0 == ~n; {7303#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:49,897 INFO L272 TraceCheckUtils]: 8: Hoare triple {7303#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} call #t~ret4 := ackermann(~m - 1, 1); {7299#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:49,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {7299#(<= |old(oldRank0)| oldRank0)} ~m := #in~m;~n := #in~n; {7303#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:49,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {7303#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} assume 0 == ~m;#res := 1 + ~n; {7319#(and (<= 0 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:49,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {7319#(and (<= 0 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} assume true; {7319#(and (<= 0 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:49,899 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7319#(and (<= 0 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} {7303#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} #43#return; {7326#(and (<= 1 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:49,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {7326#(and (<= 1 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} #res := #t~ret4;havoc #t~ret4; {7326#(and (<= 1 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:49,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {7326#(and (<= 1 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} assume true; {7326#(and (<= 1 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:49,900 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7326#(and (<= 1 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} {7289#(<= (+ ackermann_~m 1) oldRank0)} #45#return; {7222#(or (and (>= oldRank0 0) (> oldRank0 ackermann_~m)) unseeded)} is VALID [2022-02-21 03:25:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:25:49,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:25:49,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:49,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:49,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:49,936 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2022-02-21 03:25:49,936 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 108 states and 150 transitions. cyclomatic complexity: 46 Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:25:50,132 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 108 states and 150 transitions. cyclomatic complexity: 46. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Result 185 states and 266 transitions. Complement of second has 20 states. [2022-02-21 03:25:50,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:50,132 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:50,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 150 transitions. cyclomatic complexity: 46 [2022-02-21 03:25:50,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:50,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:50,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:25:50,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:50,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:50,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:50,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 266 transitions. [2022-02-21 03:25:50,135 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2022-02-21 03:25:50,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:50,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:50,136 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 108 states and 150 transitions. cyclomatic complexity: 46 [2022-02-21 03:25:50,139 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 23 examples of accepted words. [2022-02-21 03:25:50,140 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:25:50,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:50,140 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:50,140 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 185 states and 266 transitions. cyclomatic complexity: 89 [2022-02-21 03:25:50,150 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 34 examples of accepted words. [2022-02-21 03:25:50,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:50,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:50,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:50,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:50,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:50,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:50,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:50,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:50,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:50,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 185 letters. Loop has 185 letters. [2022-02-21 03:25:50,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 185 letters. Loop has 185 letters. [2022-02-21 03:25:50,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 185 letters. Loop has 185 letters. [2022-02-21 03:25:50,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 108 letters. Loop has 108 letters. [2022-02-21 03:25:50,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 108 letters. Loop has 108 letters. [2022-02-21 03:25:50,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 108 letters. Loop has 108 letters. [2022-02-21 03:25:50,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:25:50,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:25:50,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:25:50,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:50,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:50,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:50,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:25:50,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:25:50,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:25:50,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:50,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:50,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:50,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:50,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:50,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:50,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:50,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:50,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:50,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 31 letters. Loop has 8 letters. [2022-02-21 03:25:50,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 31 letters. Loop has 8 letters. [2022-02-21 03:25:50,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 31 letters. Loop has 8 letters. [2022-02-21 03:25:50,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:50,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:50,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:50,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 26 letters. Loop has 20 letters. [2022-02-21 03:25:50,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 26 letters. Loop has 20 letters. [2022-02-21 03:25:50,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 26 letters. Loop has 20 letters. [2022-02-21 03:25:50,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:50,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:50,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:50,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:50,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:50,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:50,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 27 letters. Loop has 20 letters. [2022-02-21 03:25:50,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 27 letters. Loop has 20 letters. [2022-02-21 03:25:50,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 27 letters. Loop has 20 letters. [2022-02-21 03:25:50,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:50,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:50,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:50,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 35 letters. Loop has 12 letters. [2022-02-21 03:25:50,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 35 letters. Loop has 12 letters. [2022-02-21 03:25:50,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 35 letters. Loop has 12 letters. [2022-02-21 03:25:50,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 24 letters. Loop has 12 letters. [2022-02-21 03:25:50,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 24 letters. Loop has 12 letters. [2022-02-21 03:25:50,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 24 letters. Loop has 12 letters. [2022-02-21 03:25:50,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:50,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:50,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:50,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:25:50,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:25:50,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:25:50,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 25 letters. Loop has 20 letters. [2022-02-21 03:25:50,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 25 letters. Loop has 20 letters. [2022-02-21 03:25:50,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 25 letters. Loop has 20 letters. [2022-02-21 03:25:50,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:50,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:50,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:50,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:50,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:50,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:50,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:50,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:50,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:50,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 52 letters. Loop has 48 letters. [2022-02-21 03:25:50,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 52 letters. Loop has 48 letters. [2022-02-21 03:25:50,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 52 letters. Loop has 48 letters. [2022-02-21 03:25:50,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 20 letters. Loop has 40 letters. [2022-02-21 03:25:50,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 20 letters. Loop has 40 letters. [2022-02-21 03:25:50,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 20 letters. Loop has 40 letters. [2022-02-21 03:25:50,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:50,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:50,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:50,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:50,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:50,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:50,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:50,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:50,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:50,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:25:50,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:50,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:25:50,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:25:50,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 28 letters. Loop has 12 letters. [2022-02-21 03:25:50,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 28 letters. Loop has 12 letters. [2022-02-21 03:25:50,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 28 letters. Loop has 12 letters. [2022-02-21 03:25:50,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:50,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:50,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:50,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:50,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:50,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:50,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 35 letters. Loop has 12 letters. [2022-02-21 03:25:50,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 35 letters. Loop has 12 letters. [2022-02-21 03:25:50,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 35 letters. Loop has 12 letters. [2022-02-21 03:25:50,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 31 letters. Loop has 8 letters. [2022-02-21 03:25:50,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 31 letters. Loop has 8 letters. [2022-02-21 03:25:50,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 31 letters. Loop has 8 letters. [2022-02-21 03:25:50,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:50,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:50,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:50,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:50,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:50,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:50,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:50,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:50,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:50,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:25:50,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:25:50,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:25:50,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 47 letters. Loop has 8 letters. [2022-02-21 03:25:50,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 47 letters. Loop has 8 letters. [2022-02-21 03:25:50,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 47 letters. Loop has 8 letters. [2022-02-21 03:25:50,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 47 letters. Loop has 24 letters. [2022-02-21 03:25:50,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 47 letters. Loop has 24 letters. [2022-02-21 03:25:50,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 47 letters. Loop has 24 letters. [2022-02-21 03:25:50,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 48 letters. Loop has 8 letters. [2022-02-21 03:25:50,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 48 letters. Loop has 8 letters. [2022-02-21 03:25:50,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 48 letters. Loop has 8 letters. [2022-02-21 03:25:50,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:25:50,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:25:50,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:25:50,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 49 letters. Loop has 8 letters. [2022-02-21 03:25:50,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 49 letters. Loop has 8 letters. [2022-02-21 03:25:50,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 49 letters. Loop has 8 letters. [2022-02-21 03:25:50,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:50,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:50,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:50,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 50 letters. Loop has 8 letters. [2022-02-21 03:25:50,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 50 letters. Loop has 8 letters. [2022-02-21 03:25:50,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 50 letters. Loop has 8 letters. [2022-02-21 03:25:50,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 50 letters. Loop has 4 letters. [2022-02-21 03:25:50,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 50 letters. Loop has 4 letters. [2022-02-21 03:25:50,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 50 letters. Loop has 4 letters. [2022-02-21 03:25:50,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 51 letters. Loop has 12 letters. [2022-02-21 03:25:50,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 51 letters. Loop has 12 letters. [2022-02-21 03:25:50,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 51 letters. Loop has 12 letters. [2022-02-21 03:25:50,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 51 letters. Loop has 4 letters. [2022-02-21 03:25:50,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 51 letters. Loop has 4 letters. [2022-02-21 03:25:50,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 51 letters. Loop has 4 letters. [2022-02-21 03:25:50,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 54 letters. Loop has 8 letters. [2022-02-21 03:25:50,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 54 letters. Loop has 8 letters. [2022-02-21 03:25:50,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 54 letters. Loop has 8 letters. [2022-02-21 03:25:50,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 58 letters. Loop has 12 letters. [2022-02-21 03:25:50,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 58 letters. Loop has 12 letters. [2022-02-21 03:25:50,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 58 letters. Loop has 12 letters. [2022-02-21 03:25:50,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 32 letters. Loop has 61 letters. [2022-02-21 03:25:50,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 32 letters. Loop has 61 letters. [2022-02-21 03:25:50,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 32 letters. Loop has 61 letters. [2022-02-21 03:25:50,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 43 letters. Loop has 20 letters. [2022-02-21 03:25:50,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 43 letters. Loop has 20 letters. [2022-02-21 03:25:50,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 43 letters. Loop has 20 letters. [2022-02-21 03:25:50,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 40 letters. Loop has 145 letters. [2022-02-21 03:25:50,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 40 letters. Loop has 145 letters. [2022-02-21 03:25:50,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 40 letters. Loop has 145 letters. [2022-02-21 03:25:50,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 44 letters. Loop has 20 letters. [2022-02-21 03:25:50,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 44 letters. Loop has 20 letters. [2022-02-21 03:25:50,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 44 letters. Loop has 20 letters. [2022-02-21 03:25:50,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 45 letters. Loop has 20 letters. [2022-02-21 03:25:50,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 45 letters. Loop has 20 letters. [2022-02-21 03:25:50,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 45 letters. Loop has 20 letters. [2022-02-21 03:25:50,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 46 letters. Loop has 20 letters. [2022-02-21 03:25:50,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 46 letters. Loop has 20 letters. [2022-02-21 03:25:50,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 46 letters. Loop has 20 letters. [2022-02-21 03:25:50,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 40 letters. Loop has 157 letters. [2022-02-21 03:25:50,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 40 letters. Loop has 157 letters. [2022-02-21 03:25:50,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 40 letters. Loop has 157 letters. [2022-02-21 03:25:50,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 40 letters. Loop has 145 letters. [2022-02-21 03:25:50,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 40 letters. Loop has 145 letters. [2022-02-21 03:25:50,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 40 letters. Loop has 145 letters. [2022-02-21 03:25:50,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 32 letters. Loop has 149 letters. [2022-02-21 03:25:50,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 32 letters. Loop has 149 letters. [2022-02-21 03:25:50,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 32 letters. Loop has 149 letters. [2022-02-21 03:25:50,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 43 letters. Loop has 46 letters. [2022-02-21 03:25:50,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 43 letters. Loop has 46 letters. [2022-02-21 03:25:50,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 43 letters. Loop has 46 letters. [2022-02-21 03:25:50,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 32 letters. Loop has 137 letters. [2022-02-21 03:25:50,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 32 letters. Loop has 137 letters. [2022-02-21 03:25:50,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 266 transitions. cyclomatic complexity: 89 Stem has 32 letters. Loop has 137 letters. [2022-02-21 03:25:50,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,250 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:25:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2022-02-21 03:25:50,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:50,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,252 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:50,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:25:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:50,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {7209#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7209#unseeded} is VALID [2022-02-21 03:25:50,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {7209#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {7209#unseeded} is VALID [2022-02-21 03:25:50,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {7209#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {7209#unseeded} is VALID [2022-02-21 03:25:50,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {7209#unseeded} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {7209#unseeded} is VALID [2022-02-21 03:25:50,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {7209#unseeded} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {7209#unseeded} is VALID [2022-02-21 03:25:50,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {7209#unseeded} ~m := #in~m;~n := #in~n; {7209#unseeded} is VALID [2022-02-21 03:25:50,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {7209#unseeded} assume !(0 == ~m); {7209#unseeded} is VALID [2022-02-21 03:25:50,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {7209#unseeded} assume !(0 == ~n); {7209#unseeded} is VALID [2022-02-21 03:25:50,424 INFO L272 TraceCheckUtils]: 8: Hoare triple {7209#unseeded} call #t~ret5 := ackermann(~m, ~n - 1); {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:50,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:50,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~m); {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:50,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~n; {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:50,426 INFO L272 TraceCheckUtils]: 12: Hoare triple {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := ackermann(~m - 1, 1); {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:50,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:50,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~m;#res := 1 + ~n; {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:50,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:50,429 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #43#return; {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:50,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4;havoc #t~ret4; {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:50,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:50,430 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7577#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7209#unseeded} #45#return; {7209#unseeded} is VALID [2022-02-21 03:25:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 03:25:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:50,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {7212#(>= oldRank0 ackermann_~m)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {7611#(<= (+ |ackermann_#in~m| 1) oldRank0)} is VALID [2022-02-21 03:25:50,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {7611#(<= (+ |ackermann_#in~m| 1) oldRank0)} ~m := #in~m;~n := #in~n; {7615#(<= (+ ackermann_~m 1) oldRank0)} is VALID [2022-02-21 03:25:50,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {7615#(<= (+ ackermann_~m 1) oldRank0)} assume !(0 == ~m); {7615#(<= (+ ackermann_~m 1) oldRank0)} is VALID [2022-02-21 03:25:50,686 INFO L290 TraceCheckUtils]: 3: Hoare triple {7615#(<= (+ ackermann_~m 1) oldRank0)} assume !(0 == ~n); {7615#(<= (+ ackermann_~m 1) oldRank0)} is VALID [2022-02-21 03:25:50,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {7615#(<= (+ ackermann_~m 1) oldRank0)} call #t~ret5 := ackermann(~m, ~n - 1); {7625#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:50,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {7625#(<= |old(oldRank0)| oldRank0)} ~m := #in~m;~n := #in~n; {7629#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:50,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {7629#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} assume !(0 == ~m); {7629#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:50,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {7629#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} assume 0 == ~n; {7629#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:50,690 INFO L272 TraceCheckUtils]: 8: Hoare triple {7629#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} call #t~ret4 := ackermann(~m - 1, 1); {7625#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:50,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {7625#(<= |old(oldRank0)| oldRank0)} ~m := #in~m;~n := #in~n; {7629#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:50,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {7629#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} assume 0 == ~m;#res := 1 + ~n; {7645#(and (<= 0 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:50,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {7645#(and (<= 0 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} assume true; {7645#(and (<= 0 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:50,697 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7645#(and (<= 0 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} {7629#(and (<= ackermann_~m |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} #43#return; {7652#(and (<= 1 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:50,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {7652#(and (<= 1 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} #res := #t~ret4;havoc #t~ret4; {7652#(and (<= 1 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:50,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {7652#(and (<= 1 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} assume true; {7652#(and (<= 1 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:50,699 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7652#(and (<= 1 |ackermann_#in~m|) (<= |old(oldRank0)| oldRank0))} {7615#(<= (+ ackermann_~m 1) oldRank0)} #45#return; {7222#(or (and (>= oldRank0 0) (> oldRank0 ackermann_~m)) unseeded)} is VALID [2022-02-21 03:25:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:25:50,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:25:50,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:50,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:50,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:50,728 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2022-02-21 03:25:50,728 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 108 states and 150 transitions. cyclomatic complexity: 46 Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:25:51,063 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 108 states and 150 transitions. cyclomatic complexity: 46. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Result 272 states and 409 transitions. Complement of second has 32 states. [2022-02-21 03:25:51,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:51,064 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:51,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 150 transitions. cyclomatic complexity: 46 [2022-02-21 03:25:51,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:51,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:51,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:25:51,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:51,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:51,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:51,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 272 states and 409 transitions. [2022-02-21 03:25:51,068 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2022-02-21 03:25:51,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:51,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:51,068 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 108 states and 150 transitions. cyclomatic complexity: 46 [2022-02-21 03:25:51,068 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 23 examples of accepted words. [2022-02-21 03:25:51,069 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:25:51,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:51,069 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:51,070 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 272 states and 409 transitions. cyclomatic complexity: 144 [2022-02-21 03:25:51,074 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 34 examples of accepted words. [2022-02-21 03:25:51,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:51,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:51,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:51,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 3 letters. Loop has 9 letters. [2022-02-21 03:25:51,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 3 letters. Loop has 9 letters. [2022-02-21 03:25:51,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 3 letters. Loop has 9 letters. [2022-02-21 03:25:51,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:51,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:51,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:51,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 272 letters. Loop has 272 letters. [2022-02-21 03:25:51,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 272 letters. Loop has 272 letters. [2022-02-21 03:25:51,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 272 letters. Loop has 272 letters. [2022-02-21 03:25:51,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 108 letters. Loop has 108 letters. [2022-02-21 03:25:51,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 108 letters. Loop has 108 letters. [2022-02-21 03:25:51,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 108 letters. Loop has 108 letters. [2022-02-21 03:25:51,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:25:51,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:25:51,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:25:51,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:51,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:51,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:51,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:25:51,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:25:51,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:25:51,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:51,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:51,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:51,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:51,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:51,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:51,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:51,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:51,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 21 letters. Loop has 4 letters. [2022-02-21 03:25:51,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 31 letters. Loop has 8 letters. [2022-02-21 03:25:51,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 31 letters. Loop has 8 letters. [2022-02-21 03:25:51,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 31 letters. Loop has 8 letters. [2022-02-21 03:25:51,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:51,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:51,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:51,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 26 letters. Loop has 20 letters. [2022-02-21 03:25:51,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 26 letters. Loop has 20 letters. [2022-02-21 03:25:51,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 26 letters. Loop has 20 letters. [2022-02-21 03:25:51,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:51,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:51,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:51,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:51,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:51,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:51,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 27 letters. Loop has 20 letters. [2022-02-21 03:25:51,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 27 letters. Loop has 20 letters. [2022-02-21 03:25:51,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 27 letters. Loop has 20 letters. [2022-02-21 03:25:51,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:51,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:51,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:51,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 35 letters. Loop has 12 letters. [2022-02-21 03:25:51,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 35 letters. Loop has 12 letters. [2022-02-21 03:25:51,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 35 letters. Loop has 12 letters. [2022-02-21 03:25:51,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 24 letters. Loop has 12 letters. [2022-02-21 03:25:51,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 24 letters. Loop has 12 letters. [2022-02-21 03:25:51,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 24 letters. Loop has 12 letters. [2022-02-21 03:25:51,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:51,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:51,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:51,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:25:51,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:25:51,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:25:51,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 25 letters. Loop has 20 letters. [2022-02-21 03:25:51,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 25 letters. Loop has 20 letters. [2022-02-21 03:25:51,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 25 letters. Loop has 20 letters. [2022-02-21 03:25:51,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:51,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:51,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:51,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:51,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:51,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 52 letters. Loop has 36 letters. [2022-02-21 03:25:51,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:51,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:51,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 20 letters. Loop has 28 letters. [2022-02-21 03:25:51,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 52 letters. Loop has 48 letters. [2022-02-21 03:25:51,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 52 letters. Loop has 48 letters. [2022-02-21 03:25:51,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 52 letters. Loop has 48 letters. [2022-02-21 03:25:51,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 20 letters. Loop has 40 letters. [2022-02-21 03:25:51,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 20 letters. Loop has 40 letters. [2022-02-21 03:25:51,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 20 letters. Loop has 40 letters. [2022-02-21 03:25:51,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:51,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:51,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:25:51,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 3 letters. Loop has 9 letters. [2022-02-21 03:25:51,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 3 letters. Loop has 9 letters. [2022-02-21 03:25:51,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 3 letters. Loop has 9 letters. [2022-02-21 03:25:51,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 45 letters. Loop has 20 letters. [2022-02-21 03:25:51,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 45 letters. Loop has 20 letters. [2022-02-21 03:25:51,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 45 letters. Loop has 20 letters. [2022-02-21 03:25:51,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:25:51,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:25:51,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:25:51,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 46 letters. Loop has 20 letters. [2022-02-21 03:25:51,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 46 letters. Loop has 20 letters. [2022-02-21 03:25:51,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 46 letters. Loop has 20 letters. [2022-02-21 03:25:51,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:25:51,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:25:51,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:25:51,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 47 letters. Loop has 8 letters. [2022-02-21 03:25:51,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 47 letters. Loop has 8 letters. [2022-02-21 03:25:51,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 47 letters. Loop has 8 letters. [2022-02-21 03:25:51,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 47 letters. Loop has 24 letters. [2022-02-21 03:25:51,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 47 letters. Loop has 24 letters. [2022-02-21 03:25:51,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 47 letters. Loop has 24 letters. [2022-02-21 03:25:51,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 43 letters. Loop has 12 letters. [2022-02-21 03:25:51,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 43 letters. Loop has 12 letters. [2022-02-21 03:25:51,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 43 letters. Loop has 12 letters. [2022-02-21 03:25:51,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:25:51,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:25:51,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:25:51,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 48 letters. Loop has 8 letters. [2022-02-21 03:25:51,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 48 letters. Loop has 8 letters. [2022-02-21 03:25:51,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 48 letters. Loop has 8 letters. [2022-02-21 03:25:51,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 49 letters. Loop has 8 letters. [2022-02-21 03:25:51,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 49 letters. Loop has 8 letters. [2022-02-21 03:25:51,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 49 letters. Loop has 8 letters. [2022-02-21 03:25:51,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 50 letters. Loop has 8 letters. [2022-02-21 03:25:51,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 50 letters. Loop has 8 letters. [2022-02-21 03:25:51,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 50 letters. Loop has 8 letters. [2022-02-21 03:25:51,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 54 letters. Loop has 8 letters. [2022-02-21 03:25:51,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 54 letters. Loop has 8 letters. [2022-02-21 03:25:51,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 54 letters. Loop has 8 letters. [2022-02-21 03:25:51,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 43 letters. Loop has 20 letters. [2022-02-21 03:25:51,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 43 letters. Loop has 20 letters. [2022-02-21 03:25:51,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 43 letters. Loop has 20 letters. [2022-02-21 03:25:51,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 39 letters. Loop has 61 letters. [2022-02-21 03:25:51,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 39 letters. Loop has 61 letters. [2022-02-21 03:25:51,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 39 letters. Loop has 61 letters. [2022-02-21 03:25:51,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 47 letters. Loop has 69 letters. [2022-02-21 03:25:51,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 47 letters. Loop has 69 letters. [2022-02-21 03:25:51,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 47 letters. Loop has 69 letters. [2022-02-21 03:25:51,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 44 letters. Loop has 20 letters. [2022-02-21 03:25:51,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 44 letters. Loop has 20 letters. [2022-02-21 03:25:51,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 44 letters. Loop has 20 letters. [2022-02-21 03:25:51,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 58 letters. Loop has 12 letters. [2022-02-21 03:25:51,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 58 letters. Loop has 12 letters. [2022-02-21 03:25:51,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 58 letters. Loop has 12 letters. [2022-02-21 03:25:51,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:25:51,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:25:51,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:25:51,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 39 letters. Loop has 73 letters. [2022-02-21 03:25:51,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 39 letters. Loop has 73 letters. [2022-02-21 03:25:51,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 39 letters. Loop has 73 letters. [2022-02-21 03:25:51,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 43 letters. Loop has 46 letters. [2022-02-21 03:25:51,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 43 letters. Loop has 46 letters. [2022-02-21 03:25:51,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 43 letters. Loop has 46 letters. [2022-02-21 03:25:51,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 47 letters. Loop has 81 letters. [2022-02-21 03:25:51,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 47 letters. Loop has 81 letters. [2022-02-21 03:25:51,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 47 letters. Loop has 81 letters. [2022-02-21 03:25:51,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 47 letters. Loop has 69 letters. [2022-02-21 03:25:51,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 47 letters. Loop has 69 letters. [2022-02-21 03:25:51,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 47 letters. Loop has 69 letters. [2022-02-21 03:25:51,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 39 letters. Loop has 61 letters. [2022-02-21 03:25:51,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 39 letters. Loop has 61 letters. [2022-02-21 03:25:51,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 39 letters. Loop has 61 letters. [2022-02-21 03:25:51,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 35 letters. Loop has 12 letters. [2022-02-21 03:25:51,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 35 letters. Loop has 12 letters. [2022-02-21 03:25:51,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 35 letters. Loop has 12 letters. [2022-02-21 03:25:51,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 28 letters. Loop has 12 letters. [2022-02-21 03:25:51,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 28 letters. Loop has 12 letters. [2022-02-21 03:25:51,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 28 letters. Loop has 12 letters. [2022-02-21 03:25:51,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:51,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:51,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:25:51,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 31 letters. Loop has 8 letters. [2022-02-21 03:25:51,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 31 letters. Loop has 8 letters. [2022-02-21 03:25:51,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 31 letters. Loop has 8 letters. [2022-02-21 03:25:51,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:51,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:51,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 27 letters. Loop has 8 letters. [2022-02-21 03:25:51,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:25:51,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:25:51,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:25:51,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:51,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:51,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:25:51,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:51,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:51,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:51,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:25:51,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:25:51,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:25:51,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:51,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:51,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:51,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 150 transitions. cyclomatic complexity: 46 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:51,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:51,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 272 states and 409 transitions. cyclomatic complexity: 144 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:51,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,128 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:25:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-02-21 03:25:51,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:25:51,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 36 letters. Loop has 16 letters. [2022-02-21 03:25:51,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 32 letters. [2022-02-21 03:25:51,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:51,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 409 transitions. cyclomatic complexity: 144 [2022-02-21 03:25:51,140 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2022-02-21 03:25:51,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 222 states and 347 transitions. [2022-02-21 03:25:51,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2022-02-21 03:25:51,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2022-02-21 03:25:51,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 347 transitions. [2022-02-21 03:25:51,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:51,150 INFO L681 BuchiCegarLoop]: Abstraction has 222 states and 347 transitions. [2022-02-21 03:25:51,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 347 transitions. [2022-02-21 03:25:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2022-02-21 03:25:51,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:51,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states and 347 transitions. Second operand has 209 states, 138 states have (on average 1.1666666666666667) internal successors, (161), 148 states have internal predecessors, (161), 47 states have call successors, (64), 28 states have call predecessors, (64), 24 states have return successors, (102), 32 states have call predecessors, (102), 41 states have call successors, (102) [2022-02-21 03:25:51,158 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states and 347 transitions. Second operand has 209 states, 138 states have (on average 1.1666666666666667) internal successors, (161), 148 states have internal predecessors, (161), 47 states have call successors, (64), 28 states have call predecessors, (64), 24 states have return successors, (102), 32 states have call predecessors, (102), 41 states have call successors, (102) [2022-02-21 03:25:51,159 INFO L87 Difference]: Start difference. First operand 222 states and 347 transitions. Second operand has 209 states, 138 states have (on average 1.1666666666666667) internal successors, (161), 148 states have internal predecessors, (161), 47 states have call successors, (64), 28 states have call predecessors, (64), 24 states have return successors, (102), 32 states have call predecessors, (102), 41 states have call successors, (102) [2022-02-21 03:25:51,159 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:51,200 INFO L93 Difference]: Finished difference Result 778 states and 1167 transitions. [2022-02-21 03:25:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1167 transitions. [2022-02-21 03:25:51,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:51,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:51,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 209 states, 138 states have (on average 1.1666666666666667) internal successors, (161), 148 states have internal predecessors, (161), 47 states have call successors, (64), 28 states have call predecessors, (64), 24 states have return successors, (102), 32 states have call predecessors, (102), 41 states have call successors, (102) Second operand 222 states and 347 transitions. [2022-02-21 03:25:51,206 INFO L87 Difference]: Start difference. First operand has 209 states, 138 states have (on average 1.1666666666666667) internal successors, (161), 148 states have internal predecessors, (161), 47 states have call successors, (64), 28 states have call predecessors, (64), 24 states have return successors, (102), 32 states have call predecessors, (102), 41 states have call successors, (102) Second operand 222 states and 347 transitions. [2022-02-21 03:25:51,206 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:51,248 INFO L93 Difference]: Finished difference Result 778 states and 1167 transitions. [2022-02-21 03:25:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1167 transitions. [2022-02-21 03:25:51,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:51,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:51,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:51,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 138 states have (on average 1.1666666666666667) internal successors, (161), 148 states have internal predecessors, (161), 47 states have call successors, (64), 28 states have call predecessors, (64), 24 states have return successors, (102), 32 states have call predecessors, (102), 41 states have call successors, (102) [2022-02-21 03:25:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 327 transitions. [2022-02-21 03:25:51,269 INFO L704 BuchiCegarLoop]: Abstraction has 209 states and 327 transitions. [2022-02-21 03:25:51,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:51,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 03:25:51,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:25:51,270 INFO L87 Difference]: Start difference. First operand 209 states and 327 transitions. Second operand has 16 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:25:51,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:51,793 INFO L93 Difference]: Finished difference Result 232 states and 364 transitions. [2022-02-21 03:25:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:25:51,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:25:51,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:51,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 364 transitions. [2022-02-21 03:25:51,849 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2022-02-21 03:25:51,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 230 states and 362 transitions. [2022-02-21 03:25:51,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2022-02-21 03:25:51,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2022-02-21 03:25:51,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 362 transitions. [2022-02-21 03:25:51,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:51,859 INFO L681 BuchiCegarLoop]: Abstraction has 230 states and 362 transitions. [2022-02-21 03:25:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 362 transitions. [2022-02-21 03:25:51,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2022-02-21 03:25:51,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:51,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states and 362 transitions. Second operand has 223 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 157 states have internal predecessors, (167), 48 states have call successors, (63), 30 states have call predecessors, (63), 28 states have return successors, (121), 35 states have call predecessors, (121), 42 states have call successors, (121) [2022-02-21 03:25:51,872 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states and 362 transitions. Second operand has 223 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 157 states have internal predecessors, (167), 48 states have call successors, (63), 30 states have call predecessors, (63), 28 states have return successors, (121), 35 states have call predecessors, (121), 42 states have call successors, (121) [2022-02-21 03:25:51,872 INFO L87 Difference]: Start difference. First operand 230 states and 362 transitions. Second operand has 223 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 157 states have internal predecessors, (167), 48 states have call successors, (63), 30 states have call predecessors, (63), 28 states have return successors, (121), 35 states have call predecessors, (121), 42 states have call successors, (121) [2022-02-21 03:25:51,872 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:51,923 INFO L93 Difference]: Finished difference Result 830 states and 1231 transitions. [2022-02-21 03:25:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1231 transitions. [2022-02-21 03:25:51,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:51,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:51,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 157 states have internal predecessors, (167), 48 states have call successors, (63), 30 states have call predecessors, (63), 28 states have return successors, (121), 35 states have call predecessors, (121), 42 states have call successors, (121) Second operand 230 states and 362 transitions. [2022-02-21 03:25:51,930 INFO L87 Difference]: Start difference. First operand has 223 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 157 states have internal predecessors, (167), 48 states have call successors, (63), 30 states have call predecessors, (63), 28 states have return successors, (121), 35 states have call predecessors, (121), 42 states have call successors, (121) Second operand 230 states and 362 transitions. [2022-02-21 03:25:51,930 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:51,975 INFO L93 Difference]: Finished difference Result 830 states and 1231 transitions. [2022-02-21 03:25:51,975 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1231 transitions. [2022-02-21 03:25:51,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:51,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:51,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:51,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 157 states have internal predecessors, (167), 48 states have call successors, (63), 30 states have call predecessors, (63), 28 states have return successors, (121), 35 states have call predecessors, (121), 42 states have call successors, (121) [2022-02-21 03:25:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 351 transitions. [2022-02-21 03:25:52,008 INFO L704 BuchiCegarLoop]: Abstraction has 223 states and 351 transitions. [2022-02-21 03:25:52,008 INFO L587 BuchiCegarLoop]: Abstraction has 223 states and 351 transitions. [2022-02-21 03:25:52,008 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:25:52,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 223 states and 351 transitions. [2022-02-21 03:25:52,010 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2022-02-21 03:25:52,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:52,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:52,010 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:52,010 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:25:52,011 INFO L791 eck$LassoCheckResult]: Stem: 11280#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 11281#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 11305#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 11306#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 11307#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 11308#ackermannENTRY ~m := #in~m;~n := #in~n; 11380#L17 assume !(0 == ~m); 11378#L20 assume !(0 == ~n); 11311#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11375#ackermannENTRY ~m := #in~m;~n := #in~n; 11372#L17 assume !(0 == ~m); 11373#L20 assume 0 == ~n; 11289#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11393#ackermannENTRY ~m := #in~m;~n := #in~n; 11395#L17 assume 0 == ~m;#res := 1 + ~n; 11394#ackermannFINAL assume true; 11390#ackermannEXIT >#43#return; 11389#L21-1 #res := #t~ret4;havoc #t~ret4; 11388#ackermannFINAL assume true; 11385#ackermannEXIT >#45#return; 11333#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11322#ackermannENTRY ~m := #in~m;~n := #in~n; 11469#L17 assume !(0 == ~m); 11327#L20 assume !(0 == ~n); 11329#L23 [2022-02-21 03:25:52,011 INFO L793 eck$LassoCheckResult]: Loop: 11329#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11344#ackermannENTRY ~m := #in~m;~n := #in~n; 11482#L17 assume !(0 == ~m); 11483#L20 assume !(0 == ~n); 11329#L23 [2022-02-21 03:25:52,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:52,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1132004457, now seen corresponding path program 2 times [2022-02-21 03:25:52,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:52,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890559554] [2022-02-21 03:25:52,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:52,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:52,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:25:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:52,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:52,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {14596#true} ~m := #in~m;~n := #in~n; {14612#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:52,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {14612#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} is VALID [2022-02-21 03:25:52,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} assume true; {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} is VALID [2022-02-21 03:25:52,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} {14612#(= ackermann_~m |ackermann_#in~m|)} #43#return; {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} is VALID [2022-02-21 03:25:52,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {14596#true} ~m := #in~m;~n := #in~n; {14612#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:52,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {14612#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {14612#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:52,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {14612#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {14612#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:52,092 INFO L272 TraceCheckUtils]: 3: Hoare triple {14612#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {14596#true} is VALID [2022-02-21 03:25:52,093 INFO L290 TraceCheckUtils]: 4: Hoare triple {14596#true} ~m := #in~m;~n := #in~n; {14612#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:52,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {14612#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} is VALID [2022-02-21 03:25:52,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} assume true; {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} is VALID [2022-02-21 03:25:52,094 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} {14612#(= ackermann_~m |ackermann_#in~m|)} #43#return; {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} is VALID [2022-02-21 03:25:52,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} #res := #t~ret4;havoc #t~ret4; {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} is VALID [2022-02-21 03:25:52,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} assume true; {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} is VALID [2022-02-21 03:25:52,096 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} {14596#true} #45#return; {14609#(and (<= 1 ackermann_~m) (<= ackermann_~m 1))} is VALID [2022-02-21 03:25:52,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {14596#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {14596#true} is VALID [2022-02-21 03:25:52,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {14596#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {14596#true} is VALID [2022-02-21 03:25:52,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {14596#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {14596#true} is VALID [2022-02-21 03:25:52,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {14596#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {14596#true} is VALID [2022-02-21 03:25:52,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {14596#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {14596#true} is VALID [2022-02-21 03:25:52,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {14596#true} ~m := #in~m;~n := #in~n; {14596#true} is VALID [2022-02-21 03:25:52,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {14596#true} assume !(0 == ~m); {14596#true} is VALID [2022-02-21 03:25:52,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {14596#true} assume !(0 == ~n); {14596#true} is VALID [2022-02-21 03:25:52,097 INFO L272 TraceCheckUtils]: 8: Hoare triple {14596#true} call #t~ret5 := ackermann(~m, ~n - 1); {14596#true} is VALID [2022-02-21 03:25:52,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {14596#true} ~m := #in~m;~n := #in~n; {14612#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:52,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {14612#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {14612#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:52,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {14612#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {14612#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:52,098 INFO L272 TraceCheckUtils]: 12: Hoare triple {14612#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {14596#true} is VALID [2022-02-21 03:25:52,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {14596#true} ~m := #in~m;~n := #in~n; {14612#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:52,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {14612#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} is VALID [2022-02-21 03:25:52,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} assume true; {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} is VALID [2022-02-21 03:25:52,100 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} {14612#(= ackermann_~m |ackermann_#in~m|)} #43#return; {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} is VALID [2022-02-21 03:25:52,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} #res := #t~ret4;havoc #t~ret4; {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} is VALID [2022-02-21 03:25:52,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} assume true; {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} is VALID [2022-02-21 03:25:52,102 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} {14596#true} #45#return; {14609#(and (<= 1 ackermann_~m) (<= ackermann_~m 1))} is VALID [2022-02-21 03:25:52,103 INFO L272 TraceCheckUtils]: 20: Hoare triple {14609#(and (<= 1 ackermann_~m) (<= ackermann_~m 1))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} is VALID [2022-02-21 03:25:52,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} ~m := #in~m;~n := #in~n; {14611#(and (<= ackermann_~m 0) (< 0 (+ ackermann_~m 1)))} is VALID [2022-02-21 03:25:52,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {14611#(and (<= ackermann_~m 0) (< 0 (+ ackermann_~m 1)))} assume !(0 == ~m); {14597#false} is VALID [2022-02-21 03:25:52,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {14597#false} assume !(0 == ~n); {14597#false} is VALID [2022-02-21 03:25:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:25:52,104 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:52,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890559554] [2022-02-21 03:25:52,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890559554] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:25:52,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813360032] [2022-02-21 03:25:52,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:25:52,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:25:52,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:52,106 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:25:52,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2022-02-21 03:25:52,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:25:52,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:25:52,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 03:25:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:52,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:52,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {14596#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {14596#true} is VALID [2022-02-21 03:25:52,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {14596#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {14596#true} is VALID [2022-02-21 03:25:52,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {14596#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {14596#true} is VALID [2022-02-21 03:25:52,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {14596#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {14596#true} is VALID [2022-02-21 03:25:52,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {14596#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {14596#true} is VALID [2022-02-21 03:25:52,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {14596#true} ~m := #in~m;~n := #in~n; {14596#true} is VALID [2022-02-21 03:25:52,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {14596#true} assume !(0 == ~m); {14596#true} is VALID [2022-02-21 03:25:52,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {14596#true} assume !(0 == ~n); {14596#true} is VALID [2022-02-21 03:25:52,298 INFO L272 TraceCheckUtils]: 8: Hoare triple {14596#true} call #t~ret5 := ackermann(~m, ~n - 1); {14596#true} is VALID [2022-02-21 03:25:52,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {14596#true} ~m := #in~m;~n := #in~n; {14612#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:52,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {14612#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {14612#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:52,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {14612#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {14612#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:52,300 INFO L272 TraceCheckUtils]: 12: Hoare triple {14612#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {14596#true} is VALID [2022-02-21 03:25:52,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {14596#true} ~m := #in~m;~n := #in~n; {14612#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:52,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {14612#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} is VALID [2022-02-21 03:25:52,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} assume true; {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} is VALID [2022-02-21 03:25:52,301 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} {14612#(= ackermann_~m |ackermann_#in~m|)} #43#return; {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} is VALID [2022-02-21 03:25:52,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} #res := #t~ret4;havoc #t~ret4; {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} is VALID [2022-02-21 03:25:52,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} assume true; {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} is VALID [2022-02-21 03:25:52,303 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} {14596#true} #45#return; {14609#(and (<= 1 ackermann_~m) (<= ackermann_~m 1))} is VALID [2022-02-21 03:25:52,304 INFO L272 TraceCheckUtils]: 20: Hoare triple {14609#(and (<= 1 ackermann_~m) (<= ackermann_~m 1))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} is VALID [2022-02-21 03:25:52,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} ~m := #in~m;~n := #in~n; {14611#(and (<= ackermann_~m 0) (< 0 (+ ackermann_~m 1)))} is VALID [2022-02-21 03:25:52,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {14611#(and (<= ackermann_~m 0) (< 0 (+ ackermann_~m 1)))} assume !(0 == ~m); {14597#false} is VALID [2022-02-21 03:25:52,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {14597#false} assume !(0 == ~n); {14597#false} is VALID [2022-02-21 03:25:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:25:52,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:25:52,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {14597#false} assume !(0 == ~n); {14597#false} is VALID [2022-02-21 03:25:52,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {14611#(and (<= ackermann_~m 0) (< 0 (+ ackermann_~m 1)))} assume !(0 == ~m); {14597#false} is VALID [2022-02-21 03:25:52,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} ~m := #in~m;~n := #in~n; {14611#(and (<= ackermann_~m 0) (< 0 (+ ackermann_~m 1)))} is VALID [2022-02-21 03:25:52,526 INFO L272 TraceCheckUtils]: 20: Hoare triple {14609#(and (<= 1 ackermann_~m) (<= ackermann_~m 1))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} is VALID [2022-02-21 03:25:52,527 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} {14596#true} #45#return; {14609#(and (<= 1 ackermann_~m) (<= ackermann_~m 1))} is VALID [2022-02-21 03:25:52,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} assume true; {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} is VALID [2022-02-21 03:25:52,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} #res := #t~ret4;havoc #t~ret4; {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} is VALID [2022-02-21 03:25:52,528 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} {14714#(or (not (= (+ ackermann_~m (- 1)) 0)) (and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1)))} #43#return; {14617#(and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1))} is VALID [2022-02-21 03:25:52,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} assume true; {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} is VALID [2022-02-21 03:25:52,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {14724#(or (and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0)) (not (= ackermann_~m 0)))} assume 0 == ~m;#res := 1 + ~n; {14610#(and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0))} is VALID [2022-02-21 03:25:52,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {14596#true} ~m := #in~m;~n := #in~n; {14724#(or (and (<= 0 |ackermann_#in~m|) (<= |ackermann_#in~m| 0)) (not (= ackermann_~m 0)))} is VALID [2022-02-21 03:25:52,529 INFO L272 TraceCheckUtils]: 12: Hoare triple {14714#(or (not (= (+ ackermann_~m (- 1)) 0)) (and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1)))} call #t~ret4 := ackermann(~m - 1, 1); {14596#true} is VALID [2022-02-21 03:25:52,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {14714#(or (not (= (+ ackermann_~m (- 1)) 0)) (and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1)))} assume 0 == ~n; {14714#(or (not (= (+ ackermann_~m (- 1)) 0)) (and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1)))} is VALID [2022-02-21 03:25:52,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {14714#(or (not (= (+ ackermann_~m (- 1)) 0)) (and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1)))} assume !(0 == ~m); {14714#(or (not (= (+ ackermann_~m (- 1)) 0)) (and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1)))} is VALID [2022-02-21 03:25:52,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {14596#true} ~m := #in~m;~n := #in~n; {14714#(or (not (= (+ ackermann_~m (- 1)) 0)) (and (<= 1 |ackermann_#in~m|) (<= |ackermann_#in~m| 1)))} is VALID [2022-02-21 03:25:52,531 INFO L272 TraceCheckUtils]: 8: Hoare triple {14596#true} call #t~ret5 := ackermann(~m, ~n - 1); {14596#true} is VALID [2022-02-21 03:25:52,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {14596#true} assume !(0 == ~n); {14596#true} is VALID [2022-02-21 03:25:52,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {14596#true} assume !(0 == ~m); {14596#true} is VALID [2022-02-21 03:25:52,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {14596#true} ~m := #in~m;~n := #in~n; {14596#true} is VALID [2022-02-21 03:25:52,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {14596#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {14596#true} is VALID [2022-02-21 03:25:52,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {14596#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {14596#true} is VALID [2022-02-21 03:25:52,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {14596#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {14596#true} is VALID [2022-02-21 03:25:52,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {14596#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {14596#true} is VALID [2022-02-21 03:25:52,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {14596#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {14596#true} is VALID [2022-02-21 03:25:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:25:52,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813360032] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:25:52,533 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:25:52,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 9 [2022-02-21 03:25:52,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002910028] [2022-02-21 03:25:52,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:25:52,533 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:25:52,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:52,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2259284, now seen corresponding path program 4 times [2022-02-21 03:25:52,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:52,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388380188] [2022-02-21 03:25:52,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:52,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:52,537 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:52,539 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:52,639 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:52,639 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:52,639 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:52,639 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:52,639 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:52,639 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:52,639 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:52,640 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:52,640 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration8_Loop [2022-02-21 03:25:52,640 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:52,640 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:52,640 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:25:52,643 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:25:52,647 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:25:52,648 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:25:52,651 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:25:52,652 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:25:52,731 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:52,731 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:52,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:52,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:52,732 INFO L229 MonitoredProcess]: Starting monitored process 118 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:25:52,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-02-21 03:25:52,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:52,734 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:52,740 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:52,740 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:52,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2022-02-21 03:25:52,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:52,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:52,755 INFO L229 MonitoredProcess]: Starting monitored process 119 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:25:52,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-02-21 03:25:52,762 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:52,762 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:52,773 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:52,773 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=7, ackermann_~m=7} Honda state: {ackermann_#in~m=7, ackermann_~m=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:52,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2022-02-21 03:25:52,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:52,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:52,790 INFO L229 MonitoredProcess]: Starting monitored process 120 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:25:52,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-02-21 03:25:52,792 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:52,792 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:52,798 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:52,798 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:52,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-02-21 03:25:52,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:52,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:52,813 INFO L229 MonitoredProcess]: Starting monitored process 121 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:25:52,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-02-21 03:25:52,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:52,815 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:52,821 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:52,821 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:52,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2022-02-21 03:25:52,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:52,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:52,836 INFO L229 MonitoredProcess]: Starting monitored process 122 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:25:52,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-02-21 03:25:52,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:52,838 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:52,843 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:52,844 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:52,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:52,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:52,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:52,859 INFO L229 MonitoredProcess]: Starting monitored process 123 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:25:52,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-02-21 03:25:52,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:52,861 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:52,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2022-02-21 03:25:52,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:52,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:52,887 INFO L229 MonitoredProcess]: Starting monitored process 124 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:25:52,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-02-21 03:25:52,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:52,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:55,323 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:55,323 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=-1, ackermann_#in~n=1} Honda state: {ackermann_~n=-1, ackermann_#in~n=1} Generalized eigenvectors: [{ackermann_~n=-1, ackermann_#in~n=7}, {ackermann_~n=0, ackermann_#in~n=-8}, {ackermann_~n=0, ackermann_#in~n=-2}] Lambdas: [1, 0, 0] Nus: [1, 0] [2022-02-21 03:25:55,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:55,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:55,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:25:55,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:25:55,340 INFO L87 Difference]: Start difference. First operand 223 states and 351 transitions. cyclomatic complexity: 135 Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:25:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:55,521 INFO L93 Difference]: Finished difference Result 169 states and 264 transitions. [2022-02-21 03:25:55,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:25:55,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:25:55,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:55,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 264 transitions. [2022-02-21 03:25:55,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2022-02-21 03:25:55,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 161 states and 238 transitions. [2022-02-21 03:25:55,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2022-02-21 03:25:55,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2022-02-21 03:25:55,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 238 transitions. [2022-02-21 03:25:55,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:55,557 INFO L681 BuchiCegarLoop]: Abstraction has 161 states and 238 transitions. [2022-02-21 03:25:55,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 238 transitions. [2022-02-21 03:25:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2022-02-21 03:25:55,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:55,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states and 238 transitions. Second operand has 155 states, 104 states have (on average 1.0961538461538463) internal successors, (114), 105 states have internal predecessors, (114), 31 states have call successors, (37), 23 states have call predecessors, (37), 20 states have return successors, (64), 26 states have call predecessors, (64), 29 states have call successors, (64) [2022-02-21 03:25:55,562 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states and 238 transitions. Second operand has 155 states, 104 states have (on average 1.0961538461538463) internal successors, (114), 105 states have internal predecessors, (114), 31 states have call successors, (37), 23 states have call predecessors, (37), 20 states have return successors, (64), 26 states have call predecessors, (64), 29 states have call successors, (64) [2022-02-21 03:25:55,563 INFO L87 Difference]: Start difference. First operand 161 states and 238 transitions. Second operand has 155 states, 104 states have (on average 1.0961538461538463) internal successors, (114), 105 states have internal predecessors, (114), 31 states have call successors, (37), 23 states have call predecessors, (37), 20 states have return successors, (64), 26 states have call predecessors, (64), 29 states have call successors, (64) [2022-02-21 03:25:55,563 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:55,581 INFO L93 Difference]: Finished difference Result 470 states and 671 transitions. [2022-02-21 03:25:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 671 transitions. [2022-02-21 03:25:55,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:55,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:55,584 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 104 states have (on average 1.0961538461538463) internal successors, (114), 105 states have internal predecessors, (114), 31 states have call successors, (37), 23 states have call predecessors, (37), 20 states have return successors, (64), 26 states have call predecessors, (64), 29 states have call successors, (64) Second operand 161 states and 238 transitions. [2022-02-21 03:25:55,584 INFO L87 Difference]: Start difference. First operand has 155 states, 104 states have (on average 1.0961538461538463) internal successors, (114), 105 states have internal predecessors, (114), 31 states have call successors, (37), 23 states have call predecessors, (37), 20 states have return successors, (64), 26 states have call predecessors, (64), 29 states have call successors, (64) Second operand 161 states and 238 transitions. [2022-02-21 03:25:55,584 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:55,603 INFO L93 Difference]: Finished difference Result 488 states and 697 transitions. [2022-02-21 03:25:55,604 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 697 transitions. [2022-02-21 03:25:55,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:55,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:55,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:55,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:55,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 104 states have (on average 1.0961538461538463) internal successors, (114), 105 states have internal predecessors, (114), 31 states have call successors, (37), 23 states have call predecessors, (37), 20 states have return successors, (64), 26 states have call predecessors, (64), 29 states have call successors, (64) [2022-02-21 03:25:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 215 transitions. [2022-02-21 03:25:55,610 INFO L704 BuchiCegarLoop]: Abstraction has 155 states and 215 transitions. [2022-02-21 03:25:55,610 INFO L587 BuchiCegarLoop]: Abstraction has 155 states and 215 transitions. [2022-02-21 03:25:55,610 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:25:55,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 215 transitions. [2022-02-21 03:25:55,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2022-02-21 03:25:55,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:55,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:55,616 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 7, 6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:25:55,616 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [16, 14, 10, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3] [2022-02-21 03:25:55,617 INFO L791 eck$LassoCheckResult]: Stem: 14934#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 14935#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 14947#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 14948#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 14949#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 14950#ackermannENTRY ~m := #in~m;~n := #in~n; 15039#L17 assume !(0 == ~m); 15030#L20 assume 0 == ~n; 14967#L21 call #t~ret4 := ackermann(~m - 1, 1);< 14968#ackermannENTRY ~m := #in~m;~n := #in~n; 15054#L17 assume !(0 == ~m); 15053#L20 assume !(0 == ~n); 14977#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 14978#ackermannENTRY ~m := #in~m;~n := #in~n; 15020#L17 assume !(0 == ~m); 15018#L20 assume 0 == ~n; 14972#L21 call #t~ret4 := ackermann(~m - 1, 1);< 15009#ackermannENTRY ~m := #in~m;~n := #in~n; 15034#L17 assume !(0 == ~m); 15033#L20 assume !(0 == ~n); 14997#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 15032#ackermannENTRY ~m := #in~m;~n := #in~n; 15051#L17 assume !(0 == ~m); 15049#L20 assume !(0 == ~n); 14992#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 15044#ackermannENTRY ~m := #in~m;~n := #in~n; 15048#L17 assume !(0 == ~m); 15026#L20 assume 0 == ~n; 14973#L21 call #t~ret4 := ackermann(~m - 1, 1);< 15008#ackermannENTRY ~m := #in~m;~n := #in~n; 15042#L17 assume 0 == ~m;#res := 1 + ~n; 15041#ackermannFINAL assume true; 15037#ackermannEXIT >#43#return; 15038#L21-1 #res := #t~ret4;havoc #t~ret4; 15081#ackermannFINAL assume true; 15080#ackermannEXIT >#45#return; 15074#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 15077#ackermannENTRY ~m := #in~m;~n := #in~n; 15079#L17 assume 0 == ~m;#res := 1 + ~n; 15078#ackermannFINAL assume true; 15073#ackermannEXIT >#47#return; 15076#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 15086#ackermannFINAL assume true; 15084#ackermannEXIT >#45#return; 14944#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 15087#ackermannENTRY ~m := #in~m;~n := #in~n; 15088#L17 assume 0 == ~m;#res := 1 + ~n; 14943#ackermannFINAL assume true; 14946#ackermannEXIT >#47#return; 14952#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 14975#ackermannFINAL assume true; 15005#ackermannEXIT >#43#return; 15002#L21-1 #res := #t~ret4;havoc #t~ret4; 15000#ackermannFINAL assume true; 14996#ackermannEXIT >#45#return; 14945#L23-1 [2022-02-21 03:25:55,617 INFO L793 eck$LassoCheckResult]: Loop: 14945#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 14989#ackermannENTRY ~m := #in~m;~n := #in~n; 15023#L17 assume !(0 == ~m); 14980#L20 assume 0 == ~n; 14954#L21 call #t~ret4 := ackermann(~m - 1, 1);< 14966#ackermannENTRY ~m := #in~m;~n := #in~n; 15003#L17 assume !(0 == ~m); 15001#L20 assume !(0 == ~n); 14970#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 14990#ackermannENTRY ~m := #in~m;~n := #in~n; 14985#L17 assume !(0 == ~m); 14981#L20 assume 0 == ~n; 14954#L21 call #t~ret4 := ackermann(~m - 1, 1);< 14966#ackermannENTRY ~m := #in~m;~n := #in~n; 15003#L17 assume !(0 == ~m); 15001#L20 assume !(0 == ~n); 14970#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 14990#ackermannENTRY ~m := #in~m;~n := #in~n; 14985#L17 assume !(0 == ~m); 14986#L20 assume !(0 == ~n); 14962#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 14987#ackermannENTRY ~m := #in~m;~n := #in~n; 14988#L17 assume !(0 == ~m); 15021#L20 assume !(0 == ~n); 14964#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 14987#ackermannENTRY ~m := #in~m;~n := #in~n; 14988#L17 assume !(0 == ~m); 15021#L20 assume !(0 == ~n); 14964#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 14987#ackermannENTRY ~m := #in~m;~n := #in~n; 14988#L17 assume !(0 == ~m); 15019#L20 assume 0 == ~n; 14953#L21 call #t~ret4 := ackermann(~m - 1, 1);< 14966#ackermannENTRY ~m := #in~m;~n := #in~n; 15003#L17 assume !(0 == ~m); 15001#L20 assume !(0 == ~n); 14970#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 14990#ackermannENTRY ~m := #in~m;~n := #in~n; 14985#L17 assume !(0 == ~m); 14981#L20 assume 0 == ~n; 14954#L21 call #t~ret4 := ackermann(~m - 1, 1);< 14966#ackermannENTRY ~m := #in~m;~n := #in~n; 15003#L17 assume 0 == ~m;#res := 1 + ~n; 15004#ackermannFINAL assume true; 15058#ackermannEXIT >#43#return; 14969#L21-1 #res := #t~ret4;havoc #t~ret4; 14971#ackermannFINAL assume true; 15082#ackermannEXIT >#45#return; 14937#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 14936#ackermannENTRY ~m := #in~m;~n := #in~n; 14938#L17 assume 0 == ~m;#res := 1 + ~n; 14955#ackermannFINAL assume true; 14951#ackermannEXIT >#47#return; 14952#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 14975#ackermannFINAL assume true; 15005#ackermannEXIT >#43#return; 15006#L21-1 #res := #t~ret4;havoc #t~ret4; 14999#ackermannFINAL assume true; 14991#ackermannEXIT >#45#return; 14961#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 14976#ackermannENTRY ~m := #in~m;~n := #in~n; 14982#L17 assume 0 == ~m;#res := 1 + ~n; 14983#ackermannFINAL assume true; 15059#ackermannEXIT >#47#return; 15057#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 15043#ackermannFINAL assume true; 15010#ackermannEXIT >#45#return; 15012#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 15064#ackermannENTRY ~m := #in~m;~n := #in~n; 15070#L17 assume 0 == ~m;#res := 1 + ~n; 14983#ackermannFINAL assume true; 15059#ackermannEXIT >#47#return; 15057#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 15043#ackermannFINAL assume true; 15010#ackermannEXIT >#45#return; 15011#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 15064#ackermannENTRY ~m := #in~m;~n := #in~n; 15070#L17 assume 0 == ~m;#res := 1 + ~n; 14983#ackermannFINAL assume true; 15059#ackermannEXIT >#47#return; 15060#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 15085#ackermannFINAL assume true; 15083#ackermannEXIT >#45#return; 14944#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 15087#ackermannENTRY ~m := #in~m;~n := #in~n; 15088#L17 assume 0 == ~m;#res := 1 + ~n; 14943#ackermannFINAL assume true; 14946#ackermannEXIT >#47#return; 14952#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 14975#ackermannFINAL assume true; 15005#ackermannEXIT >#43#return; 15002#L21-1 #res := #t~ret4;havoc #t~ret4; 15000#ackermannFINAL assume true; 14996#ackermannEXIT >#45#return; 14945#L23-1 [2022-02-21 03:25:55,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:55,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1370222252, now seen corresponding path program 1 times [2022-02-21 03:25:55,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:55,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814020009] [2022-02-21 03:25:55,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:55,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:55,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:25:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:55,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:55,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:55,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:55,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:55,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:55,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:55,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16933#true} {17058#(= |ackermann_#in~n| 0)} #43#return; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,758 INFO L272 TraceCheckUtils]: 3: Hoare triple {17058#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {16933#true} is VALID [2022-02-21 03:25:55,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:55,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:55,760 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16933#true} {17058#(= |ackermann_#in~n| 0)} #43#return; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {17058#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {17058#(= |ackermann_#in~n| 0)} assume true; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,761 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17058#(= |ackermann_#in~n| 0)} {17041#(= ackermann_~n |ackermann_#in~n|)} #45#return; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:25:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:55,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:55,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:55,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16933#true} {17053#(<= 1 |ackermann_#in~n|)} #47#return; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,766 INFO L272 TraceCheckUtils]: 3: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {16933#true} is VALID [2022-02-21 03:25:55,767 INFO L290 TraceCheckUtils]: 4: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,768 INFO L272 TraceCheckUtils]: 7: Hoare triple {17058#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {16933#true} is VALID [2022-02-21 03:25:55,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:55,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:55,775 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {16933#true} {17058#(= |ackermann_#in~n| 0)} #43#return; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {17058#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {17058#(= |ackermann_#in~n| 0)} assume true; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,777 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {17058#(= |ackermann_#in~n| 0)} {17041#(= ackermann_~n |ackermann_#in~n|)} #45#return; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,777 INFO L272 TraceCheckUtils]: 15: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {16933#true} is VALID [2022-02-21 03:25:55,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:55,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:55,778 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {16933#true} {17053#(<= 1 |ackermann_#in~n|)} #47#return; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} assume true; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,780 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17053#(<= 1 |ackermann_#in~n|)} {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} #45#return; {17036#(not (= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:25:55,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-21 03:25:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:55,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:55,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:55,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16933#true} {17036#(not (= |ackermann_#in~n| 1))} #47#return; {17036#(not (= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:25:55,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:25:55,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume !(0 == ~m); {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:25:55,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume !(0 == ~n); {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:25:55,786 INFO L272 TraceCheckUtils]: 3: Hoare triple {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} call #t~ret5 := ackermann(~m, ~n - 1); {16933#true} is VALID [2022-02-21 03:25:55,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,788 INFO L272 TraceCheckUtils]: 7: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {16933#true} is VALID [2022-02-21 03:25:55,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,789 INFO L272 TraceCheckUtils]: 11: Hoare triple {17058#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {16933#true} is VALID [2022-02-21 03:25:55,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:55,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:55,791 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16933#true} {17058#(= |ackermann_#in~n| 0)} #43#return; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {17058#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {17058#(= |ackermann_#in~n| 0)} assume true; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,792 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17058#(= |ackermann_#in~n| 0)} {17041#(= ackermann_~n |ackermann_#in~n|)} #45#return; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,793 INFO L272 TraceCheckUtils]: 19: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {16933#true} is VALID [2022-02-21 03:25:55,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:55,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:55,794 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16933#true} {17053#(<= 1 |ackermann_#in~n|)} #47#return; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} assume true; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,795 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17053#(<= 1 |ackermann_#in~n|)} {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} #45#return; {17036#(not (= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:25:55,795 INFO L272 TraceCheckUtils]: 27: Hoare triple {17036#(not (= |ackermann_#in~n| 1))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {16933#true} is VALID [2022-02-21 03:25:55,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:55,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:55,796 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16933#true} {17036#(not (= |ackermann_#in~n| 1))} #47#return; {17036#(not (= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:25:55,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {17036#(not (= |ackermann_#in~n| 1))} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17036#(not (= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:25:55,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {17036#(not (= |ackermann_#in~n| 1))} assume true; {17036#(not (= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:25:55,798 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17036#(not (= |ackermann_#in~n| 1))} {16933#true} #43#return; {16934#false} is VALID [2022-02-21 03:25:55,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {16933#true} assume !(0 == ~m); {16933#true} is VALID [2022-02-21 03:25:55,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {16933#true} assume 0 == ~n; {16933#true} is VALID [2022-02-21 03:25:55,798 INFO L272 TraceCheckUtils]: 3: Hoare triple {16933#true} call #t~ret4 := ackermann(~m - 1, 1); {16933#true} is VALID [2022-02-21 03:25:55,798 INFO L290 TraceCheckUtils]: 4: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:25:55,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume !(0 == ~m); {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:25:55,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume !(0 == ~n); {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:25:55,799 INFO L272 TraceCheckUtils]: 7: Hoare triple {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} call #t~ret5 := ackermann(~m, ~n - 1); {16933#true} is VALID [2022-02-21 03:25:55,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,801 INFO L272 TraceCheckUtils]: 11: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {16933#true} is VALID [2022-02-21 03:25:55,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,802 INFO L272 TraceCheckUtils]: 15: Hoare triple {17058#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {16933#true} is VALID [2022-02-21 03:25:55,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:55,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:55,803 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {16933#true} {17058#(= |ackermann_#in~n| 0)} #43#return; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {17058#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {17058#(= |ackermann_#in~n| 0)} assume true; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,804 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17058#(= |ackermann_#in~n| 0)} {17041#(= ackermann_~n |ackermann_#in~n|)} #45#return; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,804 INFO L272 TraceCheckUtils]: 23: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {16933#true} is VALID [2022-02-21 03:25:55,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:55,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:55,805 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16933#true} {17053#(<= 1 |ackermann_#in~n|)} #47#return; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} assume true; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,806 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {17053#(<= 1 |ackermann_#in~n|)} {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} #45#return; {17036#(not (= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:25:55,806 INFO L272 TraceCheckUtils]: 31: Hoare triple {17036#(not (= |ackermann_#in~n| 1))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {16933#true} is VALID [2022-02-21 03:25:55,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:55,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:55,807 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16933#true} {17036#(not (= |ackermann_#in~n| 1))} #47#return; {17036#(not (= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:25:55,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {17036#(not (= |ackermann_#in~n| 1))} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17036#(not (= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:25:55,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {17036#(not (= |ackermann_#in~n| 1))} assume true; {17036#(not (= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:25:55,808 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17036#(not (= |ackermann_#in~n| 1))} {16933#true} #43#return; {16934#false} is VALID [2022-02-21 03:25:55,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {16934#false} #res := #t~ret4;havoc #t~ret4; {16934#false} is VALID [2022-02-21 03:25:55,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {16934#false} assume true; {16934#false} is VALID [2022-02-21 03:25:55,809 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16934#false} {16933#true} #45#return; {16934#false} is VALID [2022-02-21 03:25:55,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {16933#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {16933#true} is VALID [2022-02-21 03:25:55,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {16933#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {16933#true} is VALID [2022-02-21 03:25:55,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {16933#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {16933#true} is VALID [2022-02-21 03:25:55,809 INFO L290 TraceCheckUtils]: 3: Hoare triple {16933#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {16933#true} is VALID [2022-02-21 03:25:55,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {16933#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {16933#true} is VALID [2022-02-21 03:25:55,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {16933#true} assume !(0 == ~m); {16933#true} is VALID [2022-02-21 03:25:55,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {16933#true} assume 0 == ~n; {16933#true} is VALID [2022-02-21 03:25:55,809 INFO L272 TraceCheckUtils]: 8: Hoare triple {16933#true} call #t~ret4 := ackermann(~m - 1, 1); {16933#true} is VALID [2022-02-21 03:25:55,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {16933#true} assume !(0 == ~m); {16933#true} is VALID [2022-02-21 03:25:55,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {16933#true} assume !(0 == ~n); {16933#true} is VALID [2022-02-21 03:25:55,809 INFO L272 TraceCheckUtils]: 12: Hoare triple {16933#true} call #t~ret5 := ackermann(~m, ~n - 1); {16933#true} is VALID [2022-02-21 03:25:55,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {16933#true} assume !(0 == ~m); {16933#true} is VALID [2022-02-21 03:25:55,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {16933#true} assume 0 == ~n; {16933#true} is VALID [2022-02-21 03:25:55,810 INFO L272 TraceCheckUtils]: 16: Hoare triple {16933#true} call #t~ret4 := ackermann(~m - 1, 1); {16933#true} is VALID [2022-02-21 03:25:55,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:25:55,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume !(0 == ~m); {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:25:55,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume !(0 == ~n); {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:25:55,811 INFO L272 TraceCheckUtils]: 20: Hoare triple {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} call #t~ret5 := ackermann(~m, ~n - 1); {16933#true} is VALID [2022-02-21 03:25:55,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,812 INFO L272 TraceCheckUtils]: 24: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {16933#true} is VALID [2022-02-21 03:25:55,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17041#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {17041#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,813 INFO L272 TraceCheckUtils]: 28: Hoare triple {17058#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {16933#true} is VALID [2022-02-21 03:25:55,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:55,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:55,813 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16933#true} {17058#(= |ackermann_#in~n| 0)} #43#return; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {17058#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {17058#(= |ackermann_#in~n| 0)} assume true; {17058#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:25:55,815 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {17058#(= |ackermann_#in~n| 0)} {17041#(= ackermann_~n |ackermann_#in~n|)} #45#return; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,815 INFO L272 TraceCheckUtils]: 36: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {16933#true} is VALID [2022-02-21 03:25:55,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:55,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:55,815 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16933#true} {17053#(<= 1 |ackermann_#in~n|)} #47#return; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,821 INFO L290 TraceCheckUtils]: 42: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} assume true; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:55,822 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {17053#(<= 1 |ackermann_#in~n|)} {17012#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} #45#return; {17036#(not (= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:25:55,822 INFO L272 TraceCheckUtils]: 44: Hoare triple {17036#(not (= |ackermann_#in~n| 1))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {16933#true} is VALID [2022-02-21 03:25:55,822 INFO L290 TraceCheckUtils]: 45: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:55,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:55,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:55,823 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16933#true} {17036#(not (= |ackermann_#in~n| 1))} #47#return; {17036#(not (= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:25:55,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {17036#(not (= |ackermann_#in~n| 1))} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17036#(not (= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:25:55,824 INFO L290 TraceCheckUtils]: 50: Hoare triple {17036#(not (= |ackermann_#in~n| 1))} assume true; {17036#(not (= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:25:55,824 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {17036#(not (= |ackermann_#in~n| 1))} {16933#true} #43#return; {16934#false} is VALID [2022-02-21 03:25:55,824 INFO L290 TraceCheckUtils]: 52: Hoare triple {16934#false} #res := #t~ret4;havoc #t~ret4; {16934#false} is VALID [2022-02-21 03:25:55,825 INFO L290 TraceCheckUtils]: 53: Hoare triple {16934#false} assume true; {16934#false} is VALID [2022-02-21 03:25:55,825 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16934#false} {16933#true} #45#return; {16934#false} is VALID [2022-02-21 03:25:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 52 proven. 23 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-02-21 03:25:55,825 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:55,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814020009] [2022-02-21 03:25:55,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814020009] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:25:55,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245538147] [2022-02-21 03:25:55,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:55,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:25:55,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:55,827 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:25:55,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-02-21 03:25:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:55,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:25:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:55,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:56,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {16933#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {16933#true} is VALID [2022-02-21 03:25:56,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {16933#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {16933#true} is VALID [2022-02-21 03:25:56,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {16933#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {16933#true} is VALID [2022-02-21 03:25:56,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {16933#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {16933#true} is VALID [2022-02-21 03:25:56,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {16933#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {16933#true} is VALID [2022-02-21 03:25:56,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:56,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {16933#true} assume !(0 == ~m); {16933#true} is VALID [2022-02-21 03:25:56,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {16933#true} assume 0 == ~n; {16933#true} is VALID [2022-02-21 03:25:56,082 INFO L272 TraceCheckUtils]: 8: Hoare triple {16933#true} call #t~ret4 := ackermann(~m - 1, 1); {16933#true} is VALID [2022-02-21 03:25:56,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:56,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {16933#true} assume !(0 == ~m); {16933#true} is VALID [2022-02-21 03:25:56,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {16933#true} assume !(0 == ~n); {16933#true} is VALID [2022-02-21 03:25:56,083 INFO L272 TraceCheckUtils]: 12: Hoare triple {16933#true} call #t~ret5 := ackermann(~m, ~n - 1); {16933#true} is VALID [2022-02-21 03:25:56,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:56,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {16933#true} assume !(0 == ~m); {16933#true} is VALID [2022-02-21 03:25:56,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {16933#true} assume 0 == ~n; {16933#true} is VALID [2022-02-21 03:25:56,084 INFO L272 TraceCheckUtils]: 16: Hoare triple {16933#true} call #t~ret4 := ackermann(~m - 1, 1); {16933#true} is VALID [2022-02-21 03:25:56,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17117#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {17117#(<= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17117#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {17117#(<= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {17117#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,092 INFO L272 TraceCheckUtils]: 20: Hoare triple {17117#(<= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {16933#true} is VALID [2022-02-21 03:25:56,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17117#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {17117#(<= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17117#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {17117#(<= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {17117#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,093 INFO L272 TraceCheckUtils]: 24: Hoare triple {17117#(<= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {16933#true} is VALID [2022-02-21 03:25:56,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17117#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {17117#(<= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17117#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {17117#(<= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {17148#(<= 0 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,095 INFO L272 TraceCheckUtils]: 28: Hoare triple {17148#(<= 0 |ackermann_#in~n|)} call #t~ret4 := ackermann(~m - 1, 1); {16933#true} is VALID [2022-02-21 03:25:56,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:56,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:56,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:56,096 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16933#true} {17148#(<= 0 |ackermann_#in~n|)} #43#return; {17148#(<= 0 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {17148#(<= 0 |ackermann_#in~n|)} #res := #t~ret4;havoc #t~ret4; {17148#(<= 0 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {17148#(<= 0 |ackermann_#in~n|)} assume true; {17148#(<= 0 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,098 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {17148#(<= 0 |ackermann_#in~n|)} {17117#(<= ackermann_~n |ackermann_#in~n|)} #45#return; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,098 INFO L272 TraceCheckUtils]: 36: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {16933#true} is VALID [2022-02-21 03:25:56,098 INFO L290 TraceCheckUtils]: 37: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:56,098 INFO L290 TraceCheckUtils]: 38: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:56,099 INFO L290 TraceCheckUtils]: 39: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:56,099 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16933#true} {17053#(<= 1 |ackermann_#in~n|)} #47#return; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} assume true; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,101 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {17053#(<= 1 |ackermann_#in~n|)} {17117#(<= ackermann_~n |ackermann_#in~n|)} #45#return; {17197#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,101 INFO L272 TraceCheckUtils]: 44: Hoare triple {17197#(<= 2 |ackermann_#in~n|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {16933#true} is VALID [2022-02-21 03:25:56,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:56,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:56,102 INFO L290 TraceCheckUtils]: 47: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:56,102 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16933#true} {17197#(<= 2 |ackermann_#in~n|)} #47#return; {17197#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,103 INFO L290 TraceCheckUtils]: 49: Hoare triple {17197#(<= 2 |ackermann_#in~n|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17197#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,103 INFO L290 TraceCheckUtils]: 50: Hoare triple {17197#(<= 2 |ackermann_#in~n|)} assume true; {17197#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:56,104 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {17197#(<= 2 |ackermann_#in~n|)} {16933#true} #43#return; {16934#false} is VALID [2022-02-21 03:25:56,104 INFO L290 TraceCheckUtils]: 52: Hoare triple {16934#false} #res := #t~ret4;havoc #t~ret4; {16934#false} is VALID [2022-02-21 03:25:56,104 INFO L290 TraceCheckUtils]: 53: Hoare triple {16934#false} assume true; {16934#false} is VALID [2022-02-21 03:25:56,104 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16934#false} {16933#true} #45#return; {16934#false} is VALID [2022-02-21 03:25:56,105 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 55 proven. 15 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-02-21 03:25:56,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:25:57,133 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16934#false} {16933#true} #45#return; {16934#false} is VALID [2022-02-21 03:25:57,133 INFO L290 TraceCheckUtils]: 53: Hoare triple {16934#false} assume true; {16934#false} is VALID [2022-02-21 03:25:57,133 INFO L290 TraceCheckUtils]: 52: Hoare triple {16934#false} #res := #t~ret4;havoc #t~ret4; {16934#false} is VALID [2022-02-21 03:25:57,134 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {17197#(<= 2 |ackermann_#in~n|)} {16933#true} #43#return; {16934#false} is VALID [2022-02-21 03:25:57,134 INFO L290 TraceCheckUtils]: 50: Hoare triple {17197#(<= 2 |ackermann_#in~n|)} assume true; {17197#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:57,134 INFO L290 TraceCheckUtils]: 49: Hoare triple {17197#(<= 2 |ackermann_#in~n|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17197#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:57,135 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16933#true} {17197#(<= 2 |ackermann_#in~n|)} #47#return; {17197#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:57,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:57,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:57,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:57,135 INFO L272 TraceCheckUtils]: 44: Hoare triple {17197#(<= 2 |ackermann_#in~n|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {16933#true} is VALID [2022-02-21 03:25:57,136 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {17053#(<= 1 |ackermann_#in~n|)} {17270#(or (< ackermann_~n 2) (<= 2 |ackermann_#in~n|))} #45#return; {17197#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:57,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} assume true; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:57,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:57,137 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16933#true} {17053#(<= 1 |ackermann_#in~n|)} #47#return; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:57,137 INFO L290 TraceCheckUtils]: 39: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:57,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:57,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:57,137 INFO L272 TraceCheckUtils]: 36: Hoare triple {17053#(<= 1 |ackermann_#in~n|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {16933#true} is VALID [2022-02-21 03:25:57,138 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {17148#(<= 0 |ackermann_#in~n|)} {17298#(or (< ackermann_~n 1) (<= 1 |ackermann_#in~n|))} #45#return; {17053#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:57,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {17148#(<= 0 |ackermann_#in~n|)} assume true; {17148#(<= 0 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:57,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {17148#(<= 0 |ackermann_#in~n|)} #res := #t~ret4;havoc #t~ret4; {17148#(<= 0 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:57,139 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16933#true} {17148#(<= 0 |ackermann_#in~n|)} #43#return; {17148#(<= 0 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:57,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {16933#true} assume true; {16933#true} is VALID [2022-02-21 03:25:57,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {16933#true} assume 0 == ~m;#res := 1 + ~n; {16933#true} is VALID [2022-02-21 03:25:57,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:57,140 INFO L272 TraceCheckUtils]: 28: Hoare triple {17148#(<= 0 |ackermann_#in~n|)} call #t~ret4 := ackermann(~m - 1, 1); {16933#true} is VALID [2022-02-21 03:25:57,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {17326#(or (not (<= 0 ackermann_~n)) (<= 0 |ackermann_#in~n|))} assume 0 == ~n; {17148#(<= 0 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:57,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {17326#(or (not (<= 0 ackermann_~n)) (<= 0 |ackermann_#in~n|))} assume !(0 == ~m); {17326#(or (not (<= 0 ackermann_~n)) (<= 0 |ackermann_#in~n|))} is VALID [2022-02-21 03:25:57,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17326#(or (not (<= 0 ackermann_~n)) (<= 0 |ackermann_#in~n|))} is VALID [2022-02-21 03:25:57,141 INFO L272 TraceCheckUtils]: 24: Hoare triple {17298#(or (< ackermann_~n 1) (<= 1 |ackermann_#in~n|))} call #t~ret5 := ackermann(~m, ~n - 1); {16933#true} is VALID [2022-02-21 03:25:57,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {17298#(or (< ackermann_~n 1) (<= 1 |ackermann_#in~n|))} assume !(0 == ~n); {17298#(or (< ackermann_~n 1) (<= 1 |ackermann_#in~n|))} is VALID [2022-02-21 03:25:57,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {17298#(or (< ackermann_~n 1) (<= 1 |ackermann_#in~n|))} assume !(0 == ~m); {17298#(or (< ackermann_~n 1) (<= 1 |ackermann_#in~n|))} is VALID [2022-02-21 03:25:57,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17298#(or (< ackermann_~n 1) (<= 1 |ackermann_#in~n|))} is VALID [2022-02-21 03:25:57,142 INFO L272 TraceCheckUtils]: 20: Hoare triple {17270#(or (< ackermann_~n 2) (<= 2 |ackermann_#in~n|))} call #t~ret5 := ackermann(~m, ~n - 1); {16933#true} is VALID [2022-02-21 03:25:57,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {17270#(or (< ackermann_~n 2) (<= 2 |ackermann_#in~n|))} assume !(0 == ~n); {17270#(or (< ackermann_~n 2) (<= 2 |ackermann_#in~n|))} is VALID [2022-02-21 03:25:57,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {17270#(or (< ackermann_~n 2) (<= 2 |ackermann_#in~n|))} assume !(0 == ~m); {17270#(or (< ackermann_~n 2) (<= 2 |ackermann_#in~n|))} is VALID [2022-02-21 03:25:57,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {17270#(or (< ackermann_~n 2) (<= 2 |ackermann_#in~n|))} is VALID [2022-02-21 03:25:57,143 INFO L272 TraceCheckUtils]: 16: Hoare triple {16933#true} call #t~ret4 := ackermann(~m - 1, 1); {16933#true} is VALID [2022-02-21 03:25:57,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {16933#true} assume 0 == ~n; {16933#true} is VALID [2022-02-21 03:25:57,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {16933#true} assume !(0 == ~m); {16933#true} is VALID [2022-02-21 03:25:57,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:57,143 INFO L272 TraceCheckUtils]: 12: Hoare triple {16933#true} call #t~ret5 := ackermann(~m, ~n - 1); {16933#true} is VALID [2022-02-21 03:25:57,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {16933#true} assume !(0 == ~n); {16933#true} is VALID [2022-02-21 03:25:57,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {16933#true} assume !(0 == ~m); {16933#true} is VALID [2022-02-21 03:25:57,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:57,143 INFO L272 TraceCheckUtils]: 8: Hoare triple {16933#true} call #t~ret4 := ackermann(~m - 1, 1); {16933#true} is VALID [2022-02-21 03:25:57,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {16933#true} assume 0 == ~n; {16933#true} is VALID [2022-02-21 03:25:57,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {16933#true} assume !(0 == ~m); {16933#true} is VALID [2022-02-21 03:25:57,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {16933#true} ~m := #in~m;~n := #in~n; {16933#true} is VALID [2022-02-21 03:25:57,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {16933#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {16933#true} is VALID [2022-02-21 03:25:57,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {16933#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {16933#true} is VALID [2022-02-21 03:25:57,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {16933#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {16933#true} is VALID [2022-02-21 03:25:57,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {16933#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {16933#true} is VALID [2022-02-21 03:25:57,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {16933#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {16933#true} is VALID [2022-02-21 03:25:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 55 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-02-21 03:25:57,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245538147] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:25:57,144 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:25:57,144 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8] total 13 [2022-02-21 03:25:57,144 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685603990] [2022-02-21 03:25:57,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:25:57,145 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:25:57,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:57,145 INFO L85 PathProgramCache]: Analyzing trace with hash 207170773, now seen corresponding path program 1 times [2022-02-21 03:25:57,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:57,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542540140] [2022-02-21 03:25:57,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:57,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:25:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,415 INFO L272 TraceCheckUtils]: 3: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,416 INFO L290 TraceCheckUtils]: 4: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,417 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,419 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #45#return; {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-21 03:25:57,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:25:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17393#true} {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #47#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,426 INFO L272 TraceCheckUtils]: 3: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,426 INFO L290 TraceCheckUtils]: 4: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,427 INFO L272 TraceCheckUtils]: 7: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,429 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,431 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #45#return; {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-21 03:25:57,431 INFO L272 TraceCheckUtils]: 15: Hoare triple {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,432 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {17393#true} {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #47#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,434 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,435 INFO L272 TraceCheckUtils]: 3: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,437 INFO L272 TraceCheckUtils]: 7: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,438 INFO L272 TraceCheckUtils]: 11: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,440 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,442 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #45#return; {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-21 03:25:57,442 INFO L272 TraceCheckUtils]: 19: Hoare triple {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,443 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17393#true} {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #47#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,445 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {17791#(<= 2 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {17791#(<= 2 |ackermann_#in~m|)} assume true; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,446 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {17791#(<= 2 |ackermann_#in~m|)} {17393#true} #45#return; {17728#(<= 2 ackermann_~m)} is VALID [2022-02-21 03:25:57,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-21 03:25:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17728#(<= 2 ackermann_~m)} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,462 INFO L272 TraceCheckUtils]: 3: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,462 INFO L290 TraceCheckUtils]: 4: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,463 INFO L272 TraceCheckUtils]: 7: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,465 INFO L272 TraceCheckUtils]: 11: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,466 INFO L272 TraceCheckUtils]: 15: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,468 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,469 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #45#return; {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-21 03:25:57,469 INFO L272 TraceCheckUtils]: 23: Hoare triple {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,471 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17393#true} {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #47#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,472 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {17791#(<= 2 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {17791#(<= 2 |ackermann_#in~m|)} assume true; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,474 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {17791#(<= 2 |ackermann_#in~m|)} {17393#true} #45#return; {17728#(<= 2 ackermann_~m)} is VALID [2022-02-21 03:25:57,474 INFO L272 TraceCheckUtils]: 34: Hoare triple {17728#(<= 2 ackermann_~m)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,475 INFO L290 TraceCheckUtils]: 37: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,476 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17728#(<= 2 ackermann_~m)} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,476 INFO L290 TraceCheckUtils]: 39: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,476 INFO L290 TraceCheckUtils]: 40: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,476 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {17394#false} {17393#true} #45#return; {17728#(<= 2 ackermann_~m)} is VALID [2022-02-21 03:25:57,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-21 03:25:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17728#(<= 2 ackermann_~m)} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,487 INFO L272 TraceCheckUtils]: 3: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,487 INFO L290 TraceCheckUtils]: 4: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,488 INFO L272 TraceCheckUtils]: 7: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,489 INFO L272 TraceCheckUtils]: 11: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,490 INFO L272 TraceCheckUtils]: 15: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,492 INFO L272 TraceCheckUtils]: 19: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,494 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,495 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #45#return; {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-21 03:25:57,495 INFO L272 TraceCheckUtils]: 27: Hoare triple {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,496 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17393#true} {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #47#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,498 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {17791#(<= 2 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {17791#(<= 2 |ackermann_#in~m|)} assume true; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,499 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17791#(<= 2 |ackermann_#in~m|)} {17393#true} #45#return; {17728#(<= 2 ackermann_~m)} is VALID [2022-02-21 03:25:57,499 INFO L272 TraceCheckUtils]: 38: Hoare triple {17728#(<= 2 ackermann_~m)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,500 INFO L290 TraceCheckUtils]: 40: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,500 INFO L290 TraceCheckUtils]: 41: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,501 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17728#(<= 2 ackermann_~m)} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,501 INFO L290 TraceCheckUtils]: 43: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,501 INFO L290 TraceCheckUtils]: 44: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,502 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17394#false} {17393#true} #45#return; {17728#(<= 2 ackermann_~m)} is VALID [2022-02-21 03:25:57,502 INFO L272 TraceCheckUtils]: 46: Hoare triple {17728#(<= 2 ackermann_~m)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,502 INFO L290 TraceCheckUtils]: 47: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,503 INFO L290 TraceCheckUtils]: 48: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,503 INFO L290 TraceCheckUtils]: 49: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,504 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17728#(<= 2 ackermann_~m)} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,504 INFO L290 TraceCheckUtils]: 51: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,504 INFO L290 TraceCheckUtils]: 52: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,504 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {17394#false} {17393#true} #45#return; {17394#false} is VALID [2022-02-21 03:25:57,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-21 03:25:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17393#true} {17394#false} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,508 INFO L272 TraceCheckUtils]: 3: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,508 INFO L290 TraceCheckUtils]: 4: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,509 INFO L272 TraceCheckUtils]: 7: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,509 INFO L272 TraceCheckUtils]: 11: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,511 INFO L272 TraceCheckUtils]: 15: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,512 INFO L272 TraceCheckUtils]: 19: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,513 INFO L272 TraceCheckUtils]: 23: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,515 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,517 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #45#return; {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-21 03:25:57,517 INFO L272 TraceCheckUtils]: 31: Hoare triple {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,518 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {17393#true} {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #47#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,520 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {17791#(<= 2 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {17791#(<= 2 |ackermann_#in~m|)} assume true; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,521 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {17791#(<= 2 |ackermann_#in~m|)} {17393#true} #45#return; {17728#(<= 2 ackermann_~m)} is VALID [2022-02-21 03:25:57,521 INFO L272 TraceCheckUtils]: 42: Hoare triple {17728#(<= 2 ackermann_~m)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,523 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17728#(<= 2 ackermann_~m)} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,523 INFO L290 TraceCheckUtils]: 47: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,524 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17394#false} {17393#true} #45#return; {17728#(<= 2 ackermann_~m)} is VALID [2022-02-21 03:25:57,524 INFO L272 TraceCheckUtils]: 50: Hoare triple {17728#(<= 2 ackermann_~m)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,524 INFO L290 TraceCheckUtils]: 51: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,524 INFO L290 TraceCheckUtils]: 52: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,525 INFO L290 TraceCheckUtils]: 53: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,525 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17728#(<= 2 ackermann_~m)} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,526 INFO L290 TraceCheckUtils]: 55: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,526 INFO L290 TraceCheckUtils]: 56: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,526 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {17394#false} {17393#true} #45#return; {17394#false} is VALID [2022-02-21 03:25:57,526 INFO L272 TraceCheckUtils]: 58: Hoare triple {17394#false} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,526 INFO L290 TraceCheckUtils]: 59: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,526 INFO L290 TraceCheckUtils]: 60: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,526 INFO L290 TraceCheckUtils]: 61: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,527 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {17393#true} {17394#false} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,527 INFO L290 TraceCheckUtils]: 63: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,527 INFO L290 TraceCheckUtils]: 64: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,527 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {17394#false} {17393#true} #45#return; {17394#false} is VALID [2022-02-21 03:25:57,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-02-21 03:25:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17393#true} {17394#false} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,532 INFO L272 TraceCheckUtils]: 3: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,532 INFO L290 TraceCheckUtils]: 4: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,532 INFO L272 TraceCheckUtils]: 7: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,533 INFO L272 TraceCheckUtils]: 11: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,534 INFO L272 TraceCheckUtils]: 15: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,535 INFO L272 TraceCheckUtils]: 19: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,536 INFO L272 TraceCheckUtils]: 23: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,537 INFO L272 TraceCheckUtils]: 27: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,539 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,540 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #45#return; {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-21 03:25:57,540 INFO L272 TraceCheckUtils]: 35: Hoare triple {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,540 INFO L290 TraceCheckUtils]: 36: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,541 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17393#true} {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #47#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,542 INFO L290 TraceCheckUtils]: 40: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,542 INFO L290 TraceCheckUtils]: 41: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,543 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,543 INFO L290 TraceCheckUtils]: 43: Hoare triple {17791#(<= 2 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,543 INFO L290 TraceCheckUtils]: 44: Hoare triple {17791#(<= 2 |ackermann_#in~m|)} assume true; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,544 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17791#(<= 2 |ackermann_#in~m|)} {17393#true} #45#return; {17728#(<= 2 ackermann_~m)} is VALID [2022-02-21 03:25:57,544 INFO L272 TraceCheckUtils]: 46: Hoare triple {17728#(<= 2 ackermann_~m)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,544 INFO L290 TraceCheckUtils]: 47: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,544 INFO L290 TraceCheckUtils]: 48: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,545 INFO L290 TraceCheckUtils]: 49: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,545 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17728#(<= 2 ackermann_~m)} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,545 INFO L290 TraceCheckUtils]: 51: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,545 INFO L290 TraceCheckUtils]: 52: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,546 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {17394#false} {17393#true} #45#return; {17728#(<= 2 ackermann_~m)} is VALID [2022-02-21 03:25:57,546 INFO L272 TraceCheckUtils]: 54: Hoare triple {17728#(<= 2 ackermann_~m)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,546 INFO L290 TraceCheckUtils]: 55: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,546 INFO L290 TraceCheckUtils]: 56: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,547 INFO L290 TraceCheckUtils]: 57: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,547 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17728#(<= 2 ackermann_~m)} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,547 INFO L290 TraceCheckUtils]: 59: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,547 INFO L290 TraceCheckUtils]: 60: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,547 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {17394#false} {17393#true} #45#return; {17394#false} is VALID [2022-02-21 03:25:57,547 INFO L272 TraceCheckUtils]: 62: Hoare triple {17394#false} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,548 INFO L290 TraceCheckUtils]: 63: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,548 INFO L290 TraceCheckUtils]: 64: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,548 INFO L290 TraceCheckUtils]: 65: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,548 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17393#true} {17394#false} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,548 INFO L290 TraceCheckUtils]: 67: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,548 INFO L290 TraceCheckUtils]: 68: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,548 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {17394#false} {17393#true} #45#return; {17394#false} is VALID [2022-02-21 03:25:57,548 INFO L272 TraceCheckUtils]: 70: Hoare triple {17394#false} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,548 INFO L290 TraceCheckUtils]: 71: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,548 INFO L290 TraceCheckUtils]: 72: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,548 INFO L290 TraceCheckUtils]: 73: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,548 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17393#true} {17394#false} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,548 INFO L290 TraceCheckUtils]: 75: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,548 INFO L290 TraceCheckUtils]: 76: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,549 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {17394#false} {17393#true} #43#return; {17394#false} is VALID [2022-02-21 03:25:57,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {17393#true} assume 0 == ~n; {17393#true} is VALID [2022-02-21 03:25:57,549 INFO L272 TraceCheckUtils]: 3: Hoare triple {17393#true} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,549 INFO L290 TraceCheckUtils]: 4: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,549 INFO L272 TraceCheckUtils]: 7: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,549 INFO L272 TraceCheckUtils]: 11: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,550 INFO L272 TraceCheckUtils]: 15: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,550 INFO L272 TraceCheckUtils]: 19: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,552 INFO L272 TraceCheckUtils]: 23: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,553 INFO L272 TraceCheckUtils]: 27: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,554 INFO L272 TraceCheckUtils]: 31: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,556 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,556 INFO L290 TraceCheckUtils]: 36: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,557 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #45#return; {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-21 03:25:57,558 INFO L272 TraceCheckUtils]: 39: Hoare triple {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,558 INFO L290 TraceCheckUtils]: 41: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,559 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {17393#true} {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #47#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,560 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,561 INFO L290 TraceCheckUtils]: 47: Hoare triple {17791#(<= 2 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,561 INFO L290 TraceCheckUtils]: 48: Hoare triple {17791#(<= 2 |ackermann_#in~m|)} assume true; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,562 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17791#(<= 2 |ackermann_#in~m|)} {17393#true} #45#return; {17728#(<= 2 ackermann_~m)} is VALID [2022-02-21 03:25:57,562 INFO L272 TraceCheckUtils]: 50: Hoare triple {17728#(<= 2 ackermann_~m)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,562 INFO L290 TraceCheckUtils]: 51: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,562 INFO L290 TraceCheckUtils]: 52: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,563 INFO L290 TraceCheckUtils]: 53: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,563 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17728#(<= 2 ackermann_~m)} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,564 INFO L290 TraceCheckUtils]: 55: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,564 INFO L290 TraceCheckUtils]: 56: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,564 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {17394#false} {17393#true} #45#return; {17728#(<= 2 ackermann_~m)} is VALID [2022-02-21 03:25:57,564 INFO L272 TraceCheckUtils]: 58: Hoare triple {17728#(<= 2 ackermann_~m)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,564 INFO L290 TraceCheckUtils]: 59: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,565 INFO L290 TraceCheckUtils]: 61: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,566 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17728#(<= 2 ackermann_~m)} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,566 INFO L290 TraceCheckUtils]: 63: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,566 INFO L290 TraceCheckUtils]: 64: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,566 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {17394#false} {17393#true} #45#return; {17394#false} is VALID [2022-02-21 03:25:57,566 INFO L272 TraceCheckUtils]: 66: Hoare triple {17394#false} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,566 INFO L290 TraceCheckUtils]: 67: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,567 INFO L290 TraceCheckUtils]: 68: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,567 INFO L290 TraceCheckUtils]: 69: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,567 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {17393#true} {17394#false} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,567 INFO L290 TraceCheckUtils]: 71: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,567 INFO L290 TraceCheckUtils]: 72: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,567 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17394#false} {17393#true} #45#return; {17394#false} is VALID [2022-02-21 03:25:57,567 INFO L272 TraceCheckUtils]: 74: Hoare triple {17394#false} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,568 INFO L290 TraceCheckUtils]: 75: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,568 INFO L290 TraceCheckUtils]: 76: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,568 INFO L290 TraceCheckUtils]: 77: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,568 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {17393#true} {17394#false} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,568 INFO L290 TraceCheckUtils]: 79: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,568 INFO L290 TraceCheckUtils]: 80: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,568 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17394#false} {17393#true} #43#return; {17394#false} is VALID [2022-02-21 03:25:57,569 INFO L290 TraceCheckUtils]: 82: Hoare triple {17394#false} #res := #t~ret4;havoc #t~ret4; {17394#false} is VALID [2022-02-21 03:25:57,569 INFO L290 TraceCheckUtils]: 83: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,569 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {17394#false} {17393#true} #45#return; {17394#false} is VALID [2022-02-21 03:25:57,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {17393#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,570 INFO L290 TraceCheckUtils]: 3: Hoare triple {17393#true} assume 0 == ~n; {17393#true} is VALID [2022-02-21 03:25:57,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {17393#true} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,570 INFO L272 TraceCheckUtils]: 8: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {17393#true} assume 0 == ~n; {17393#true} is VALID [2022-02-21 03:25:57,571 INFO L272 TraceCheckUtils]: 12: Hoare triple {17393#true} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,571 INFO L272 TraceCheckUtils]: 16: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,572 INFO L272 TraceCheckUtils]: 20: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,573 INFO L272 TraceCheckUtils]: 24: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:57,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:57,573 INFO L272 TraceCheckUtils]: 28: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,574 INFO L290 TraceCheckUtils]: 31: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,574 INFO L272 TraceCheckUtils]: 32: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,576 INFO L272 TraceCheckUtils]: 36: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:57,576 INFO L290 TraceCheckUtils]: 37: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,576 INFO L290 TraceCheckUtils]: 38: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,577 INFO L290 TraceCheckUtils]: 39: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,577 INFO L272 TraceCheckUtils]: 40: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:57,577 INFO L290 TraceCheckUtils]: 41: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,578 INFO L290 TraceCheckUtils]: 42: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,578 INFO L290 TraceCheckUtils]: 43: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,579 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,579 INFO L290 TraceCheckUtils]: 46: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,580 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #45#return; {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-21 03:25:57,580 INFO L272 TraceCheckUtils]: 48: Hoare triple {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,581 INFO L290 TraceCheckUtils]: 50: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,581 INFO L290 TraceCheckUtils]: 51: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,581 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17393#true} {17803#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #47#return; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,582 INFO L290 TraceCheckUtils]: 53: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,582 INFO L290 TraceCheckUtils]: 54: Hoare triple {17808#(<= 1 |ackermann_#in~m|)} assume true; {17808#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,583 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17808#(<= 1 |ackermann_#in~m|)} {17767#(= ackermann_~m |ackermann_#in~m|)} #43#return; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,583 INFO L290 TraceCheckUtils]: 56: Hoare triple {17791#(<= 2 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {17791#(<= 2 |ackermann_#in~m|)} assume true; {17791#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,584 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17791#(<= 2 |ackermann_#in~m|)} {17393#true} #45#return; {17728#(<= 2 ackermann_~m)} is VALID [2022-02-21 03:25:57,584 INFO L272 TraceCheckUtils]: 59: Hoare triple {17728#(<= 2 ackermann_~m)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,585 INFO L290 TraceCheckUtils]: 60: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,585 INFO L290 TraceCheckUtils]: 61: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,585 INFO L290 TraceCheckUtils]: 62: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,586 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17728#(<= 2 ackermann_~m)} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,586 INFO L290 TraceCheckUtils]: 64: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,586 INFO L290 TraceCheckUtils]: 65: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,587 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17394#false} {17393#true} #45#return; {17728#(<= 2 ackermann_~m)} is VALID [2022-02-21 03:25:57,587 INFO L272 TraceCheckUtils]: 67: Hoare triple {17728#(<= 2 ackermann_~m)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,587 INFO L290 TraceCheckUtils]: 68: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17767#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:25:57,587 INFO L290 TraceCheckUtils]: 69: Hoare triple {17767#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,588 INFO L290 TraceCheckUtils]: 70: Hoare triple {17813#(= |ackermann_#in~m| 0)} assume true; {17813#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:25:57,588 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17813#(= |ackermann_#in~m| 0)} {17728#(<= 2 ackermann_~m)} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,589 INFO L290 TraceCheckUtils]: 72: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,589 INFO L290 TraceCheckUtils]: 73: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,589 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17394#false} {17393#true} #45#return; {17394#false} is VALID [2022-02-21 03:25:57,589 INFO L272 TraceCheckUtils]: 75: Hoare triple {17394#false} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,589 INFO L290 TraceCheckUtils]: 76: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,589 INFO L290 TraceCheckUtils]: 77: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,589 INFO L290 TraceCheckUtils]: 78: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,590 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {17393#true} {17394#false} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,590 INFO L290 TraceCheckUtils]: 80: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,590 INFO L290 TraceCheckUtils]: 81: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,590 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17394#false} {17393#true} #45#return; {17394#false} is VALID [2022-02-21 03:25:57,591 INFO L272 TraceCheckUtils]: 83: Hoare triple {17394#false} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:57,591 INFO L290 TraceCheckUtils]: 84: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:57,591 INFO L290 TraceCheckUtils]: 85: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:57,591 INFO L290 TraceCheckUtils]: 86: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:57,591 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {17393#true} {17394#false} #47#return; {17394#false} is VALID [2022-02-21 03:25:57,591 INFO L290 TraceCheckUtils]: 88: Hoare triple {17394#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17394#false} is VALID [2022-02-21 03:25:57,591 INFO L290 TraceCheckUtils]: 89: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,592 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17394#false} {17393#true} #43#return; {17394#false} is VALID [2022-02-21 03:25:57,592 INFO L290 TraceCheckUtils]: 91: Hoare triple {17394#false} #res := #t~ret4;havoc #t~ret4; {17394#false} is VALID [2022-02-21 03:25:57,592 INFO L290 TraceCheckUtils]: 92: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:57,592 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {17394#false} {17393#true} #45#return; {17394#false} is VALID [2022-02-21 03:25:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 182 proven. 76 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-02-21 03:25:57,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:57,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542540140] [2022-02-21 03:25:57,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542540140] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:25:57,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190816822] [2022-02-21 03:25:57,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:57,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:25:57,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:57,608 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:25:57,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-02-21 03:25:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:25:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:58,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {17393#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:58,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:58,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:58,061 INFO L290 TraceCheckUtils]: 3: Hoare triple {17393#true} assume 0 == ~n; {17393#true} is VALID [2022-02-21 03:25:58,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {17393#true} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:58,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:58,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:58,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:58,061 INFO L272 TraceCheckUtils]: 8: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:58,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:58,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:58,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {17393#true} assume 0 == ~n; {17393#true} is VALID [2022-02-21 03:25:58,061 INFO L272 TraceCheckUtils]: 12: Hoare triple {17393#true} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:58,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17856#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {17856#(<= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17856#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {17856#(<= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {17856#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,062 INFO L272 TraceCheckUtils]: 16: Hoare triple {17856#(<= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:58,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17856#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {17856#(<= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17856#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {17856#(<= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {17856#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,064 INFO L272 TraceCheckUtils]: 20: Hoare triple {17856#(<= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:58,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17856#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {17856#(<= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17856#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {17856#(<= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {17856#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,065 INFO L272 TraceCheckUtils]: 24: Hoare triple {17856#(<= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:58,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17856#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {17856#(<= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17856#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {17856#(<= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {17856#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,066 INFO L272 TraceCheckUtils]: 28: Hoare triple {17856#(<= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:58,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17856#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {17856#(<= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {17856#(<= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {17856#(<= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {17911#(<= 0 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,067 INFO L272 TraceCheckUtils]: 32: Hoare triple {17911#(<= 0 |ackermann_#in~n|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:58,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:58,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:58,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:25:58,067 INFO L272 TraceCheckUtils]: 36: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:25:58,067 INFO L290 TraceCheckUtils]: 37: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:58,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:25:58,067 INFO L290 TraceCheckUtils]: 39: Hoare triple {17393#true} assume 0 == ~n; {17393#true} is VALID [2022-02-21 03:25:58,067 INFO L272 TraceCheckUtils]: 40: Hoare triple {17393#true} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:25:58,067 INFO L290 TraceCheckUtils]: 41: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:58,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:58,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:58,067 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17393#true} {17393#true} #43#return; {17393#true} is VALID [2022-02-21 03:25:58,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {17393#true} #res := #t~ret4;havoc #t~ret4; {17393#true} is VALID [2022-02-21 03:25:58,068 INFO L290 TraceCheckUtils]: 46: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:58,068 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17393#true} {17393#true} #45#return; {17393#true} is VALID [2022-02-21 03:25:58,068 INFO L272 TraceCheckUtils]: 48: Hoare triple {17393#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:58,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:58,068 INFO L290 TraceCheckUtils]: 50: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:58,068 INFO L290 TraceCheckUtils]: 51: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:58,068 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17393#true} {17393#true} #47#return; {17393#true} is VALID [2022-02-21 03:25:58,068 INFO L290 TraceCheckUtils]: 53: Hoare triple {17393#true} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17393#true} is VALID [2022-02-21 03:25:58,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:58,069 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17393#true} {17911#(<= 0 |ackermann_#in~n|)} #43#return; {17911#(<= 0 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {17911#(<= 0 |ackermann_#in~n|)} #res := #t~ret4;havoc #t~ret4; {17911#(<= 0 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,069 INFO L290 TraceCheckUtils]: 57: Hoare triple {17911#(<= 0 |ackermann_#in~n|)} assume true; {17911#(<= 0 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,070 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17911#(<= 0 |ackermann_#in~n|)} {17856#(<= ackermann_~n |ackermann_#in~n|)} #45#return; {17993#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,070 INFO L272 TraceCheckUtils]: 59: Hoare triple {17993#(<= 1 |ackermann_#in~n|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:58,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:58,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:58,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:58,071 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17393#true} {17993#(<= 1 |ackermann_#in~n|)} #47#return; {17993#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,071 INFO L290 TraceCheckUtils]: 64: Hoare triple {17993#(<= 1 |ackermann_#in~n|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17993#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,072 INFO L290 TraceCheckUtils]: 65: Hoare triple {17993#(<= 1 |ackermann_#in~n|)} assume true; {17993#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,072 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17993#(<= 1 |ackermann_#in~n|)} {17856#(<= ackermann_~n |ackermann_#in~n|)} #45#return; {18018#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,073 INFO L272 TraceCheckUtils]: 67: Hoare triple {18018#(<= 2 |ackermann_#in~n|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:58,073 INFO L290 TraceCheckUtils]: 68: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:58,073 INFO L290 TraceCheckUtils]: 69: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:58,073 INFO L290 TraceCheckUtils]: 70: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:58,073 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17393#true} {18018#(<= 2 |ackermann_#in~n|)} #47#return; {18018#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,074 INFO L290 TraceCheckUtils]: 72: Hoare triple {18018#(<= 2 |ackermann_#in~n|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {18018#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,074 INFO L290 TraceCheckUtils]: 73: Hoare triple {18018#(<= 2 |ackermann_#in~n|)} assume true; {18018#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,075 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18018#(<= 2 |ackermann_#in~n|)} {17856#(<= ackermann_~n |ackermann_#in~n|)} #45#return; {18043#(<= 3 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,075 INFO L272 TraceCheckUtils]: 75: Hoare triple {18043#(<= 3 |ackermann_#in~n|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:58,075 INFO L290 TraceCheckUtils]: 76: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:58,075 INFO L290 TraceCheckUtils]: 77: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:58,075 INFO L290 TraceCheckUtils]: 78: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:58,075 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {17393#true} {18043#(<= 3 |ackermann_#in~n|)} #47#return; {18043#(<= 3 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,076 INFO L290 TraceCheckUtils]: 80: Hoare triple {18043#(<= 3 |ackermann_#in~n|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {18043#(<= 3 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,076 INFO L290 TraceCheckUtils]: 81: Hoare triple {18043#(<= 3 |ackermann_#in~n|)} assume true; {18043#(<= 3 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,077 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {18043#(<= 3 |ackermann_#in~n|)} {17856#(<= ackermann_~n |ackermann_#in~n|)} #45#return; {18068#(<= 4 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,077 INFO L272 TraceCheckUtils]: 83: Hoare triple {18068#(<= 4 |ackermann_#in~n|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:25:58,077 INFO L290 TraceCheckUtils]: 84: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:25:58,077 INFO L290 TraceCheckUtils]: 85: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:25:58,077 INFO L290 TraceCheckUtils]: 86: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:25:58,078 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {17393#true} {18068#(<= 4 |ackermann_#in~n|)} #47#return; {18068#(<= 4 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,078 INFO L290 TraceCheckUtils]: 88: Hoare triple {18068#(<= 4 |ackermann_#in~n|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {18068#(<= 4 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,078 INFO L290 TraceCheckUtils]: 89: Hoare triple {18068#(<= 4 |ackermann_#in~n|)} assume true; {18068#(<= 4 |ackermann_#in~n|)} is VALID [2022-02-21 03:25:58,079 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {18068#(<= 4 |ackermann_#in~n|)} {17393#true} #43#return; {17394#false} is VALID [2022-02-21 03:25:58,079 INFO L290 TraceCheckUtils]: 91: Hoare triple {17394#false} #res := #t~ret4;havoc #t~ret4; {17394#false} is VALID [2022-02-21 03:25:58,079 INFO L290 TraceCheckUtils]: 92: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:25:58,079 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {17394#false} {17393#true} #45#return; {17394#false} is VALID [2022-02-21 03:25:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 169 proven. 75 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-02-21 03:25:58,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:26:00,970 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {17394#false} {17393#true} #45#return; {17394#false} is VALID [2022-02-21 03:26:00,970 INFO L290 TraceCheckUtils]: 92: Hoare triple {17394#false} assume true; {17394#false} is VALID [2022-02-21 03:26:00,970 INFO L290 TraceCheckUtils]: 91: Hoare triple {17394#false} #res := #t~ret4;havoc #t~ret4; {17394#false} is VALID [2022-02-21 03:26:00,971 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {18018#(<= 2 |ackermann_#in~n|)} {17393#true} #43#return; {17394#false} is VALID [2022-02-21 03:26:00,971 INFO L290 TraceCheckUtils]: 89: Hoare triple {18018#(<= 2 |ackermann_#in~n|)} assume true; {18018#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,972 INFO L290 TraceCheckUtils]: 88: Hoare triple {18018#(<= 2 |ackermann_#in~n|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {18018#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,973 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {17393#true} {18018#(<= 2 |ackermann_#in~n|)} #47#return; {18018#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,973 INFO L290 TraceCheckUtils]: 86: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:26:00,973 INFO L290 TraceCheckUtils]: 85: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:26:00,973 INFO L290 TraceCheckUtils]: 84: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:26:00,973 INFO L272 TraceCheckUtils]: 83: Hoare triple {18018#(<= 2 |ackermann_#in~n|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:26:00,974 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {18043#(<= 3 |ackermann_#in~n|)} {18141#(or (< ackermann_~n 4) (<= 2 |ackermann_#in~n|))} #45#return; {18018#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,974 INFO L290 TraceCheckUtils]: 81: Hoare triple {18043#(<= 3 |ackermann_#in~n|)} assume true; {18043#(<= 3 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,974 INFO L290 TraceCheckUtils]: 80: Hoare triple {18043#(<= 3 |ackermann_#in~n|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {18043#(<= 3 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,975 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {17393#true} {18043#(<= 3 |ackermann_#in~n|)} #47#return; {18043#(<= 3 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,975 INFO L290 TraceCheckUtils]: 78: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:26:00,975 INFO L290 TraceCheckUtils]: 77: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:26:00,975 INFO L290 TraceCheckUtils]: 76: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:26:00,975 INFO L272 TraceCheckUtils]: 75: Hoare triple {18043#(<= 3 |ackermann_#in~n|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:26:00,976 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18018#(<= 2 |ackermann_#in~n|)} {18169#(or (<= 3 |ackermann_#in~n|) (< ackermann_~n 3))} #45#return; {18043#(<= 3 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,976 INFO L290 TraceCheckUtils]: 73: Hoare triple {18018#(<= 2 |ackermann_#in~n|)} assume true; {18018#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,976 INFO L290 TraceCheckUtils]: 72: Hoare triple {18018#(<= 2 |ackermann_#in~n|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {18018#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,977 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17393#true} {18018#(<= 2 |ackermann_#in~n|)} #47#return; {18018#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,977 INFO L290 TraceCheckUtils]: 70: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:26:00,977 INFO L290 TraceCheckUtils]: 69: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:26:00,977 INFO L290 TraceCheckUtils]: 68: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:26:00,977 INFO L272 TraceCheckUtils]: 67: Hoare triple {18018#(<= 2 |ackermann_#in~n|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:26:00,978 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17993#(<= 1 |ackermann_#in~n|)} {18197#(or (< ackermann_~n 2) (<= 2 |ackermann_#in~n|))} #45#return; {18018#(<= 2 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,978 INFO L290 TraceCheckUtils]: 65: Hoare triple {17993#(<= 1 |ackermann_#in~n|)} assume true; {17993#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,979 INFO L290 TraceCheckUtils]: 64: Hoare triple {17993#(<= 1 |ackermann_#in~n|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17993#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,979 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17393#true} {17993#(<= 1 |ackermann_#in~n|)} #47#return; {17993#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,979 INFO L290 TraceCheckUtils]: 62: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:26:00,979 INFO L290 TraceCheckUtils]: 61: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:26:00,979 INFO L290 TraceCheckUtils]: 60: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:26:00,980 INFO L272 TraceCheckUtils]: 59: Hoare triple {17993#(<= 1 |ackermann_#in~n|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:26:00,980 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17911#(<= 0 |ackermann_#in~n|)} {18225#(or (< ackermann_~n 1) (<= 1 |ackermann_#in~n|))} #45#return; {17993#(<= 1 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,981 INFO L290 TraceCheckUtils]: 57: Hoare triple {17911#(<= 0 |ackermann_#in~n|)} assume true; {17911#(<= 0 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,981 INFO L290 TraceCheckUtils]: 56: Hoare triple {17911#(<= 0 |ackermann_#in~n|)} #res := #t~ret4;havoc #t~ret4; {17911#(<= 0 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,982 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17393#true} {17911#(<= 0 |ackermann_#in~n|)} #43#return; {17911#(<= 0 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,982 INFO L290 TraceCheckUtils]: 54: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:26:00,982 INFO L290 TraceCheckUtils]: 53: Hoare triple {17393#true} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {17393#true} is VALID [2022-02-21 03:26:00,982 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17393#true} {17393#true} #47#return; {17393#true} is VALID [2022-02-21 03:26:00,982 INFO L290 TraceCheckUtils]: 51: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:26:00,982 INFO L290 TraceCheckUtils]: 50: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:26:00,982 INFO L290 TraceCheckUtils]: 49: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:26:00,982 INFO L272 TraceCheckUtils]: 48: Hoare triple {17393#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:26:00,982 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17393#true} {17393#true} #45#return; {17393#true} is VALID [2022-02-21 03:26:00,982 INFO L290 TraceCheckUtils]: 46: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:26:00,982 INFO L290 TraceCheckUtils]: 45: Hoare triple {17393#true} #res := #t~ret4;havoc #t~ret4; {17393#true} is VALID [2022-02-21 03:26:00,982 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17393#true} {17393#true} #43#return; {17393#true} is VALID [2022-02-21 03:26:00,982 INFO L290 TraceCheckUtils]: 43: Hoare triple {17393#true} assume true; {17393#true} is VALID [2022-02-21 03:26:00,982 INFO L290 TraceCheckUtils]: 42: Hoare triple {17393#true} assume 0 == ~m;#res := 1 + ~n; {17393#true} is VALID [2022-02-21 03:26:00,982 INFO L290 TraceCheckUtils]: 41: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:26:00,983 INFO L272 TraceCheckUtils]: 40: Hoare triple {17393#true} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:26:00,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {17393#true} assume 0 == ~n; {17393#true} is VALID [2022-02-21 03:26:00,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:26:00,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:26:00,983 INFO L272 TraceCheckUtils]: 36: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:26:00,983 INFO L290 TraceCheckUtils]: 35: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:26:00,983 INFO L290 TraceCheckUtils]: 34: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:26:00,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:26:00,983 INFO L272 TraceCheckUtils]: 32: Hoare triple {17911#(<= 0 |ackermann_#in~n|)} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:26:00,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {18310#(or (not (<= 0 ackermann_~n)) (<= 0 |ackermann_#in~n|))} assume 0 == ~n; {17911#(<= 0 |ackermann_#in~n|)} is VALID [2022-02-21 03:26:00,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {18310#(or (not (<= 0 ackermann_~n)) (<= 0 |ackermann_#in~n|))} assume !(0 == ~m); {18310#(or (not (<= 0 ackermann_~n)) (<= 0 |ackermann_#in~n|))} is VALID [2022-02-21 03:26:00,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {18310#(or (not (<= 0 ackermann_~n)) (<= 0 |ackermann_#in~n|))} is VALID [2022-02-21 03:26:00,984 INFO L272 TraceCheckUtils]: 28: Hoare triple {18225#(or (< ackermann_~n 1) (<= 1 |ackermann_#in~n|))} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:26:00,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {18225#(or (< ackermann_~n 1) (<= 1 |ackermann_#in~n|))} assume !(0 == ~n); {18225#(or (< ackermann_~n 1) (<= 1 |ackermann_#in~n|))} is VALID [2022-02-21 03:26:00,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {18225#(or (< ackermann_~n 1) (<= 1 |ackermann_#in~n|))} assume !(0 == ~m); {18225#(or (< ackermann_~n 1) (<= 1 |ackermann_#in~n|))} is VALID [2022-02-21 03:26:01,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {18225#(or (< ackermann_~n 1) (<= 1 |ackermann_#in~n|))} is VALID [2022-02-21 03:26:01,000 INFO L272 TraceCheckUtils]: 24: Hoare triple {18197#(or (< ackermann_~n 2) (<= 2 |ackermann_#in~n|))} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:26:01,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {18197#(or (< ackermann_~n 2) (<= 2 |ackermann_#in~n|))} assume !(0 == ~n); {18197#(or (< ackermann_~n 2) (<= 2 |ackermann_#in~n|))} is VALID [2022-02-21 03:26:01,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {18197#(or (< ackermann_~n 2) (<= 2 |ackermann_#in~n|))} assume !(0 == ~m); {18197#(or (< ackermann_~n 2) (<= 2 |ackermann_#in~n|))} is VALID [2022-02-21 03:26:01,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {18197#(or (< ackermann_~n 2) (<= 2 |ackermann_#in~n|))} is VALID [2022-02-21 03:26:01,002 INFO L272 TraceCheckUtils]: 20: Hoare triple {18169#(or (<= 3 |ackermann_#in~n|) (< ackermann_~n 3))} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:26:01,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {18169#(or (<= 3 |ackermann_#in~n|) (< ackermann_~n 3))} assume !(0 == ~n); {18169#(or (<= 3 |ackermann_#in~n|) (< ackermann_~n 3))} is VALID [2022-02-21 03:26:01,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {18169#(or (<= 3 |ackermann_#in~n|) (< ackermann_~n 3))} assume !(0 == ~m); {18169#(or (<= 3 |ackermann_#in~n|) (< ackermann_~n 3))} is VALID [2022-02-21 03:26:01,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {18169#(or (<= 3 |ackermann_#in~n|) (< ackermann_~n 3))} is VALID [2022-02-21 03:26:01,004 INFO L272 TraceCheckUtils]: 16: Hoare triple {18141#(or (< ackermann_~n 4) (<= 2 |ackermann_#in~n|))} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:26:01,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {18141#(or (< ackermann_~n 4) (<= 2 |ackermann_#in~n|))} assume !(0 == ~n); {18141#(or (< ackermann_~n 4) (<= 2 |ackermann_#in~n|))} is VALID [2022-02-21 03:26:01,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {18141#(or (< ackermann_~n 4) (<= 2 |ackermann_#in~n|))} assume !(0 == ~m); {18141#(or (< ackermann_~n 4) (<= 2 |ackermann_#in~n|))} is VALID [2022-02-21 03:26:01,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {18141#(or (< ackermann_~n 4) (<= 2 |ackermann_#in~n|))} is VALID [2022-02-21 03:26:01,006 INFO L272 TraceCheckUtils]: 12: Hoare triple {17393#true} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:26:01,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {17393#true} assume 0 == ~n; {17393#true} is VALID [2022-02-21 03:26:01,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:26:01,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:26:01,006 INFO L272 TraceCheckUtils]: 8: Hoare triple {17393#true} call #t~ret5 := ackermann(~m, ~n - 1); {17393#true} is VALID [2022-02-21 03:26:01,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {17393#true} assume !(0 == ~n); {17393#true} is VALID [2022-02-21 03:26:01,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:26:01,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:26:01,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {17393#true} call #t~ret4 := ackermann(~m - 1, 1); {17393#true} is VALID [2022-02-21 03:26:01,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {17393#true} assume 0 == ~n; {17393#true} is VALID [2022-02-21 03:26:01,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {17393#true} assume !(0 == ~m); {17393#true} is VALID [2022-02-21 03:26:01,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {17393#true} ~m := #in~m;~n := #in~n; {17393#true} is VALID [2022-02-21 03:26:01,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {17393#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {17393#true} is VALID [2022-02-21 03:26:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 167 proven. 99 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2022-02-21 03:26:01,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190816822] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:26:01,008 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:26:01,009 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 19 [2022-02-21 03:26:01,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744079004] [2022-02-21 03:26:01,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:26:01,010 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:26:01,010 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:26:01,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 03:26:01,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:26:01,011 INFO L87 Difference]: Start difference. First operand 155 states and 215 transitions. cyclomatic complexity: 64 Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (14), 6 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-21 03:26:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:26:01,349 INFO L93 Difference]: Finished difference Result 177 states and 292 transitions. [2022-02-21 03:26:01,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:26:01,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (14), 6 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-21 03:26:01,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:26:01,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 292 transitions. [2022-02-21 03:26:01,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-02-21 03:26:01,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 156 states and 245 transitions. [2022-02-21 03:26:01,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2022-02-21 03:26:01,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2022-02-21 03:26:01,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 245 transitions. [2022-02-21 03:26:01,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:26:01,420 INFO L681 BuchiCegarLoop]: Abstraction has 156 states and 245 transitions. [2022-02-21 03:26:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 245 transitions. [2022-02-21 03:26:01,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2022-02-21 03:26:01,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:26:01,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states and 245 transitions. Second operand has 137 states, 93 states have (on average 1.10752688172043) internal successors, (103), 94 states have internal predecessors, (103), 28 states have call successors, (33), 21 states have call predecessors, (33), 16 states have return successors, (48), 21 states have call predecessors, (48), 25 states have call successors, (48) [2022-02-21 03:26:01,424 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states and 245 transitions. Second operand has 137 states, 93 states have (on average 1.10752688172043) internal successors, (103), 94 states have internal predecessors, (103), 28 states have call successors, (33), 21 states have call predecessors, (33), 16 states have return successors, (48), 21 states have call predecessors, (48), 25 states have call successors, (48) [2022-02-21 03:26:01,425 INFO L87 Difference]: Start difference. First operand 156 states and 245 transitions. Second operand has 137 states, 93 states have (on average 1.10752688172043) internal successors, (103), 94 states have internal predecessors, (103), 28 states have call successors, (33), 21 states have call predecessors, (33), 16 states have return successors, (48), 21 states have call predecessors, (48), 25 states have call successors, (48) [2022-02-21 03:26:01,425 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:01,459 INFO L93 Difference]: Finished difference Result 540 states and 863 transitions. [2022-02-21 03:26:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 863 transitions. [2022-02-21 03:26:01,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:01,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:01,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 93 states have (on average 1.10752688172043) internal successors, (103), 94 states have internal predecessors, (103), 28 states have call successors, (33), 21 states have call predecessors, (33), 16 states have return successors, (48), 21 states have call predecessors, (48), 25 states have call successors, (48) Second operand 156 states and 245 transitions. [2022-02-21 03:26:01,464 INFO L87 Difference]: Start difference. First operand has 137 states, 93 states have (on average 1.10752688172043) internal successors, (103), 94 states have internal predecessors, (103), 28 states have call successors, (33), 21 states have call predecessors, (33), 16 states have return successors, (48), 21 states have call predecessors, (48), 25 states have call successors, (48) Second operand 156 states and 245 transitions. [2022-02-21 03:26:01,464 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:01,494 INFO L93 Difference]: Finished difference Result 611 states and 982 transitions. [2022-02-21 03:26:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 982 transitions. [2022-02-21 03:26:01,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:01,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:01,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:26:01,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:26:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 93 states have (on average 1.10752688172043) internal successors, (103), 94 states have internal predecessors, (103), 28 states have call successors, (33), 21 states have call predecessors, (33), 16 states have return successors, (48), 21 states have call predecessors, (48), 25 states have call successors, (48) [2022-02-21 03:26:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 184 transitions. [2022-02-21 03:26:01,502 INFO L704 BuchiCegarLoop]: Abstraction has 137 states and 184 transitions. [2022-02-21 03:26:01,502 INFO L587 BuchiCegarLoop]: Abstraction has 137 states and 184 transitions. [2022-02-21 03:26:01,502 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 03:26:01,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 184 transitions. [2022-02-21 03:26:01,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-02-21 03:26:01,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:01,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:01,505 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:26:01,505 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3] [2022-02-21 03:26:01,505 INFO L791 eck$LassoCheckResult]: Stem: 18571#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 18572#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 18594#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 18595#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 18589#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 18596#ackermannENTRY ~m := #in~m;~n := #in~n; 18646#L17 assume !(0 == ~m); 18644#L20 assume !(0 == ~n); 18592#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 18640#ackermannENTRY ~m := #in~m;~n := #in~n; 18641#L17 assume !(0 == ~m); 18600#L20 assume 0 == ~n; 18601#L21 call #t~ret4 := ackermann(~m - 1, 1);< 18659#ackermannENTRY ~m := #in~m;~n := #in~n; 18692#L17 assume !(0 == ~m); 18690#L20 assume !(0 == ~n); 18603#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 18650#ackermannENTRY ~m := #in~m;~n := #in~n; 18651#L17 assume !(0 == ~m); 18649#L20 assume 0 == ~n; 18633#L21 call #t~ret4 := ackermann(~m - 1, 1);< 18676#ackermannENTRY ~m := #in~m;~n := #in~n; 18684#L17 assume 0 == ~m;#res := 1 + ~n; 18679#ackermannFINAL assume true; 18654#ackermannEXIT >#43#return; 18655#L21-1 #res := #t~ret4;havoc #t~ret4; 18688#ackermannFINAL assume true; 18686#ackermannEXIT >#45#return; 18682#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 18683#ackermannENTRY ~m := #in~m;~n := #in~n; 18687#L17 assume 0 == ~m;#res := 1 + ~n; 18685#ackermannFINAL assume true; 18681#ackermannEXIT >#47#return; 18678#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 18677#ackermannFINAL assume true; 18675#ackermannEXIT >#43#return; 18658#L21-1 #res := #t~ret4;havoc #t~ret4; 18705#ackermannFINAL assume true; 18701#ackermannEXIT >#45#return; 18582#L23-1 [2022-02-21 03:26:01,506 INFO L793 eck$LassoCheckResult]: Loop: 18582#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 18616#ackermannENTRY ~m := #in~m;~n := #in~n; 18624#L17 assume !(0 == ~m); 18625#L20 assume !(0 == ~n); 18587#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 18616#ackermannENTRY ~m := #in~m;~n := #in~n; 18624#L17 assume !(0 == ~m); 18625#L20 assume 0 == ~n; 18610#L21 call #t~ret4 := ackermann(~m - 1, 1);< 18611#ackermannENTRY ~m := #in~m;~n := #in~n; 18636#L17 assume !(0 == ~m); 18635#L20 assume !(0 == ~n); 18623#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 18631#ackermannENTRY ~m := #in~m;~n := #in~n; 18632#L17 assume !(0 == ~m); 18622#L20 assume 0 == ~n; 18621#L21 call #t~ret4 := ackermann(~m - 1, 1);< 18611#ackermannENTRY ~m := #in~m;~n := #in~n; 18636#L17 assume !(0 == ~m); 18635#L20 assume !(0 == ~n); 18623#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 18631#ackermannENTRY ~m := #in~m;~n := #in~n; 18632#L17 assume !(0 == ~m); 18622#L20 assume 0 == ~n; 18621#L21 call #t~ret4 := ackermann(~m - 1, 1);< 18611#ackermannENTRY ~m := #in~m;~n := #in~n; 18636#L17 assume 0 == ~m;#res := 1 + ~n; 18637#ackermannFINAL assume true; 18652#ackermannEXIT >#43#return; 18653#L21-1 #res := #t~ret4;havoc #t~ret4; 18672#ackermannFINAL assume true; 18669#ackermannEXIT >#45#return; 18664#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 18665#ackermannENTRY ~m := #in~m;~n := #in~n; 18670#L17 assume 0 == ~m;#res := 1 + ~n; 18666#ackermannFINAL assume true; 18663#ackermannEXIT >#47#return; 18661#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 18660#ackermannFINAL assume true; 18656#ackermannEXIT >#43#return; 18657#L21-1 #res := #t~ret4;havoc #t~ret4; 18671#ackermannFINAL assume true; 18667#ackermannEXIT >#45#return; 18620#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 18629#ackermannENTRY ~m := #in~m;~n := #in~n; 18630#L17 assume !(0 == ~m); 18618#L20 assume 0 == ~n; 18621#L21 call #t~ret4 := ackermann(~m - 1, 1);< 18611#ackermannENTRY ~m := #in~m;~n := #in~n; 18636#L17 assume !(0 == ~m); 18635#L20 assume !(0 == ~n); 18623#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 18631#ackermannENTRY ~m := #in~m;~n := #in~n; 18632#L17 assume !(0 == ~m); 18622#L20 assume 0 == ~n; 18621#L21 call #t~ret4 := ackermann(~m - 1, 1);< 18611#ackermannENTRY ~m := #in~m;~n := #in~n; 18636#L17 assume 0 == ~m;#res := 1 + ~n; 18637#ackermannFINAL assume true; 18652#ackermannEXIT >#43#return; 18653#L21-1 #res := #t~ret4;havoc #t~ret4; 18672#ackermannFINAL assume true; 18669#ackermannEXIT >#45#return; 18664#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 18665#ackermannENTRY ~m := #in~m;~n := #in~n; 18670#L17 assume 0 == ~m;#res := 1 + ~n; 18666#ackermannFINAL assume true; 18663#ackermannEXIT >#47#return; 18661#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 18660#ackermannFINAL assume true; 18656#ackermannEXIT >#43#return; 18657#L21-1 #res := #t~ret4;havoc #t~ret4; 18671#ackermannFINAL assume true; 18667#ackermannEXIT >#47#return; 18661#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 18660#ackermannFINAL assume true; 18656#ackermannEXIT >#43#return; 18658#L21-1 #res := #t~ret4;havoc #t~ret4; 18705#ackermannFINAL assume true; 18701#ackermannEXIT >#45#return; 18582#L23-1 [2022-02-21 03:26:01,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:01,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1100790060, now seen corresponding path program 2 times [2022-02-21 03:26:01,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:01,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787425189] [2022-02-21 03:26:01,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:01,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:01,515 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:01,522 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:01,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:01,523 INFO L85 PathProgramCache]: Analyzing trace with hash -119431079, now seen corresponding path program 2 times [2022-02-21 03:26:01,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:01,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239219141] [2022-02-21 03:26:01,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:01,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:01,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:26:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:01,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:01,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:01,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:01,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:01,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:01,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:01,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20842#true} {20842#true} #43#return; {20842#true} is VALID [2022-02-21 03:26:01,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:01,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {20842#true} assume 0 == ~n; {20842#true} is VALID [2022-02-21 03:26:01,641 INFO L272 TraceCheckUtils]: 3: Hoare triple {20842#true} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,641 INFO L290 TraceCheckUtils]: 4: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:01,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,642 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20842#true} {20842#true} #43#return; {20842#true} is VALID [2022-02-21 03:26:01,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {20842#true} #res := #t~ret4;havoc #t~ret4; {20842#true} is VALID [2022-02-21 03:26:01,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,643 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20842#true} {21048#(= ackermann_~m |ackermann_#in~m|)} #45#return; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:26:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:01,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {21093#(= |ackermann_#in~m| 0)} assume true; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21093#(= |ackermann_#in~m| 0)} {21048#(= ackermann_~m |ackermann_#in~m|)} #47#return; {21088#(<= |ackermann_#in~m| 1)} is VALID [2022-02-21 03:26:01,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,657 INFO L272 TraceCheckUtils]: 3: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:01,657 INFO L290 TraceCheckUtils]: 4: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:01,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {20842#true} assume 0 == ~n; {20842#true} is VALID [2022-02-21 03:26:01,658 INFO L272 TraceCheckUtils]: 7: Hoare triple {20842#true} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:01,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,658 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {20842#true} {20842#true} #43#return; {20842#true} is VALID [2022-02-21 03:26:01,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {20842#true} #res := #t~ret4;havoc #t~ret4; {20842#true} is VALID [2022-02-21 03:26:01,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,659 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {20842#true} {21048#(= ackermann_~m |ackermann_#in~m|)} #45#return; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,660 INFO L272 TraceCheckUtils]: 15: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:01,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {21093#(= |ackermann_#in~m| 0)} assume true; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,661 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {21093#(= |ackermann_#in~m| 0)} {21048#(= ackermann_~m |ackermann_#in~m|)} #47#return; {21088#(<= |ackermann_#in~m| 1)} is VALID [2022-02-21 03:26:01,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {21088#(<= |ackermann_#in~m| 1)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {21088#(<= |ackermann_#in~m| 1)} is VALID [2022-02-21 03:26:01,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {21088#(<= |ackermann_#in~m| 1)} assume true; {21088#(<= |ackermann_#in~m| 1)} is VALID [2022-02-21 03:26:01,663 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21088#(<= |ackermann_#in~m| 1)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21072#(<= |ackermann_#in~m| 2)} is VALID [2022-02-21 03:26:01,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,664 INFO L272 TraceCheckUtils]: 3: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,666 INFO L272 TraceCheckUtils]: 7: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:01,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:01,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {20842#true} assume 0 == ~n; {20842#true} is VALID [2022-02-21 03:26:01,666 INFO L272 TraceCheckUtils]: 11: Hoare triple {20842#true} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:01,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,667 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20842#true} {20842#true} #43#return; {20842#true} is VALID [2022-02-21 03:26:01,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {20842#true} #res := #t~ret4;havoc #t~ret4; {20842#true} is VALID [2022-02-21 03:26:01,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,668 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20842#true} {21048#(= ackermann_~m |ackermann_#in~m|)} #45#return; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,668 INFO L272 TraceCheckUtils]: 19: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:01,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {21093#(= |ackermann_#in~m| 0)} assume true; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,670 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21093#(= |ackermann_#in~m| 0)} {21048#(= ackermann_~m |ackermann_#in~m|)} #47#return; {21088#(<= |ackermann_#in~m| 1)} is VALID [2022-02-21 03:26:01,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {21088#(<= |ackermann_#in~m| 1)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {21088#(<= |ackermann_#in~m| 1)} is VALID [2022-02-21 03:26:01,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {21088#(<= |ackermann_#in~m| 1)} assume true; {21088#(<= |ackermann_#in~m| 1)} is VALID [2022-02-21 03:26:01,671 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21088#(<= |ackermann_#in~m| 1)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21072#(<= |ackermann_#in~m| 2)} is VALID [2022-02-21 03:26:01,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {21072#(<= |ackermann_#in~m| 2)} #res := #t~ret4;havoc #t~ret4; {21072#(<= |ackermann_#in~m| 2)} is VALID [2022-02-21 03:26:01,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {21072#(<= |ackermann_#in~m| 2)} assume true; {21072#(<= |ackermann_#in~m| 2)} is VALID [2022-02-21 03:26:01,673 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {21072#(<= |ackermann_#in~m| 2)} {20842#true} #45#return; {21017#(<= ackermann_~m 2)} is VALID [2022-02-21 03:26:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-21 03:26:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:01,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:01,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:01,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:01,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {21093#(= |ackermann_#in~m| 0)} assume true; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21093#(= |ackermann_#in~m| 0)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,751 INFO L272 TraceCheckUtils]: 3: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {21093#(= |ackermann_#in~m| 0)} assume true; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,754 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {21093#(= |ackermann_#in~m| 0)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} assume true; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,756 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21134#(<= 1 |ackermann_#in~m|)} {21048#(= ackermann_~m |ackermann_#in~m|)} #45#return; {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-21 03:26:01,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:26:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:01,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:01,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20842#true} {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #47#return; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,763 INFO L272 TraceCheckUtils]: 3: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:01,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,764 INFO L272 TraceCheckUtils]: 7: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {21093#(= |ackermann_#in~m| 0)} assume true; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,766 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {21093#(= |ackermann_#in~m| 0)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} assume true; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,768 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {21134#(<= 1 |ackermann_#in~m|)} {21048#(= ackermann_~m |ackermann_#in~m|)} #45#return; {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-21 03:26:01,768 INFO L272 TraceCheckUtils]: 15: Hoare triple {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:01,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:01,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,769 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {20842#true} {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #47#return; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} assume true; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,771 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21134#(<= 1 |ackermann_#in~m|)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21117#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,772 INFO L272 TraceCheckUtils]: 3: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,772 INFO L290 TraceCheckUtils]: 4: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,773 INFO L272 TraceCheckUtils]: 7: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:01,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,775 INFO L272 TraceCheckUtils]: 11: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {21093#(= |ackermann_#in~m| 0)} assume true; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,777 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21093#(= |ackermann_#in~m| 0)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} assume true; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,778 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {21134#(<= 1 |ackermann_#in~m|)} {21048#(= ackermann_~m |ackermann_#in~m|)} #45#return; {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-21 03:26:01,778 INFO L272 TraceCheckUtils]: 19: Hoare triple {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:01,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:01,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,779 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20842#true} {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #47#return; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} assume true; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,781 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21134#(<= 1 |ackermann_#in~m|)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21117#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {21117#(<= 2 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {21117#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {21117#(<= 2 |ackermann_#in~m|)} assume true; {21117#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,782 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {21117#(<= 2 |ackermann_#in~m|)} {21017#(<= ackermann_~m 2)} #47#return; {20843#false} is VALID [2022-02-21 03:26:01,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:01,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {20842#true} assume !(0 == ~n); {20842#true} is VALID [2022-02-21 03:26:01,783 INFO L272 TraceCheckUtils]: 3: Hoare triple {20842#true} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:01,783 INFO L290 TraceCheckUtils]: 4: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,784 INFO L272 TraceCheckUtils]: 7: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,786 INFO L272 TraceCheckUtils]: 11: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:01,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:01,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {20842#true} assume 0 == ~n; {20842#true} is VALID [2022-02-21 03:26:01,786 INFO L272 TraceCheckUtils]: 15: Hoare triple {20842#true} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:01,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,787 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {20842#true} {20842#true} #43#return; {20842#true} is VALID [2022-02-21 03:26:01,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {20842#true} #res := #t~ret4;havoc #t~ret4; {20842#true} is VALID [2022-02-21 03:26:01,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,788 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20842#true} {21048#(= ackermann_~m |ackermann_#in~m|)} #45#return; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,788 INFO L272 TraceCheckUtils]: 23: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:01,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {21093#(= |ackermann_#in~m| 0)} assume true; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,790 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {21093#(= |ackermann_#in~m| 0)} {21048#(= ackermann_~m |ackermann_#in~m|)} #47#return; {21088#(<= |ackermann_#in~m| 1)} is VALID [2022-02-21 03:26:01,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {21088#(<= |ackermann_#in~m| 1)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {21088#(<= |ackermann_#in~m| 1)} is VALID [2022-02-21 03:26:01,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {21088#(<= |ackermann_#in~m| 1)} assume true; {21088#(<= |ackermann_#in~m| 1)} is VALID [2022-02-21 03:26:01,791 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {21088#(<= |ackermann_#in~m| 1)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21072#(<= |ackermann_#in~m| 2)} is VALID [2022-02-21 03:26:01,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {21072#(<= |ackermann_#in~m| 2)} #res := #t~ret4;havoc #t~ret4; {21072#(<= |ackermann_#in~m| 2)} is VALID [2022-02-21 03:26:01,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {21072#(<= |ackermann_#in~m| 2)} assume true; {21072#(<= |ackermann_#in~m| 2)} is VALID [2022-02-21 03:26:01,793 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {21072#(<= |ackermann_#in~m| 2)} {20842#true} #45#return; {21017#(<= ackermann_~m 2)} is VALID [2022-02-21 03:26:01,793 INFO L272 TraceCheckUtils]: 34: Hoare triple {21017#(<= ackermann_~m 2)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:01,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,794 INFO L272 TraceCheckUtils]: 38: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,794 INFO L290 TraceCheckUtils]: 39: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,795 INFO L272 TraceCheckUtils]: 42: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:01,796 INFO L290 TraceCheckUtils]: 43: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,796 INFO L290 TraceCheckUtils]: 45: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,797 INFO L272 TraceCheckUtils]: 46: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,797 INFO L290 TraceCheckUtils]: 47: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,797 INFO L290 TraceCheckUtils]: 48: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,798 INFO L290 TraceCheckUtils]: 49: Hoare triple {21093#(= |ackermann_#in~m| 0)} assume true; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,798 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21093#(= |ackermann_#in~m| 0)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,799 INFO L290 TraceCheckUtils]: 51: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,799 INFO L290 TraceCheckUtils]: 52: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} assume true; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,800 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {21134#(<= 1 |ackermann_#in~m|)} {21048#(= ackermann_~m |ackermann_#in~m|)} #45#return; {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-21 03:26:01,800 INFO L272 TraceCheckUtils]: 54: Hoare triple {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:01,800 INFO L290 TraceCheckUtils]: 55: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,800 INFO L290 TraceCheckUtils]: 56: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:01,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,801 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20842#true} {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #47#return; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,802 INFO L290 TraceCheckUtils]: 59: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,802 INFO L290 TraceCheckUtils]: 60: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} assume true; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,803 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {21134#(<= 1 |ackermann_#in~m|)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21117#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,803 INFO L290 TraceCheckUtils]: 62: Hoare triple {21117#(<= 2 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {21117#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,804 INFO L290 TraceCheckUtils]: 63: Hoare triple {21117#(<= 2 |ackermann_#in~m|)} assume true; {21117#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,804 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21117#(<= 2 |ackermann_#in~m|)} {21017#(<= ackermann_~m 2)} #47#return; {20843#false} is VALID [2022-02-21 03:26:01,804 INFO L290 TraceCheckUtils]: 65: Hoare triple {20843#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {20843#false} is VALID [2022-02-21 03:26:01,805 INFO L290 TraceCheckUtils]: 66: Hoare triple {20843#false} assume true; {20843#false} is VALID [2022-02-21 03:26:01,805 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {20843#false} {20842#true} #43#return; {20843#false} is VALID [2022-02-21 03:26:01,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:01,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {20842#true} assume 0 == ~n; {20842#true} is VALID [2022-02-21 03:26:01,805 INFO L272 TraceCheckUtils]: 3: Hoare triple {20842#true} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,806 INFO L290 TraceCheckUtils]: 4: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:01,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {20842#true} assume !(0 == ~n); {20842#true} is VALID [2022-02-21 03:26:01,806 INFO L272 TraceCheckUtils]: 7: Hoare triple {20842#true} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:01,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,807 INFO L272 TraceCheckUtils]: 11: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,809 INFO L272 TraceCheckUtils]: 15: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:01,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:01,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {20842#true} assume 0 == ~n; {20842#true} is VALID [2022-02-21 03:26:01,817 INFO L272 TraceCheckUtils]: 19: Hoare triple {20842#true} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:01,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,817 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20842#true} {20842#true} #43#return; {20842#true} is VALID [2022-02-21 03:26:01,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {20842#true} #res := #t~ret4;havoc #t~ret4; {20842#true} is VALID [2022-02-21 03:26:01,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,818 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20842#true} {21048#(= ackermann_~m |ackermann_#in~m|)} #45#return; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,818 INFO L272 TraceCheckUtils]: 27: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:01,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {21093#(= |ackermann_#in~m| 0)} assume true; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,820 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21093#(= |ackermann_#in~m| 0)} {21048#(= ackermann_~m |ackermann_#in~m|)} #47#return; {21088#(<= |ackermann_#in~m| 1)} is VALID [2022-02-21 03:26:01,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {21088#(<= |ackermann_#in~m| 1)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {21088#(<= |ackermann_#in~m| 1)} is VALID [2022-02-21 03:26:01,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {21088#(<= |ackermann_#in~m| 1)} assume true; {21088#(<= |ackermann_#in~m| 1)} is VALID [2022-02-21 03:26:01,822 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {21088#(<= |ackermann_#in~m| 1)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21072#(<= |ackermann_#in~m| 2)} is VALID [2022-02-21 03:26:01,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {21072#(<= |ackermann_#in~m| 2)} #res := #t~ret4;havoc #t~ret4; {21072#(<= |ackermann_#in~m| 2)} is VALID [2022-02-21 03:26:01,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {21072#(<= |ackermann_#in~m| 2)} assume true; {21072#(<= |ackermann_#in~m| 2)} is VALID [2022-02-21 03:26:01,823 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {21072#(<= |ackermann_#in~m| 2)} {20842#true} #45#return; {21017#(<= ackermann_~m 2)} is VALID [2022-02-21 03:26:01,823 INFO L272 TraceCheckUtils]: 38: Hoare triple {21017#(<= ackermann_~m 2)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:01,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,825 INFO L272 TraceCheckUtils]: 42: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,826 INFO L272 TraceCheckUtils]: 46: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:01,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,827 INFO L290 TraceCheckUtils]: 48: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,827 INFO L290 TraceCheckUtils]: 49: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,827 INFO L272 TraceCheckUtils]: 50: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,828 INFO L290 TraceCheckUtils]: 51: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,828 INFO L290 TraceCheckUtils]: 52: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,828 INFO L290 TraceCheckUtils]: 53: Hoare triple {21093#(= |ackermann_#in~m| 0)} assume true; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,829 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21093#(= |ackermann_#in~m| 0)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,830 INFO L290 TraceCheckUtils]: 56: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} assume true; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,831 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {21134#(<= 1 |ackermann_#in~m|)} {21048#(= ackermann_~m |ackermann_#in~m|)} #45#return; {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-21 03:26:01,831 INFO L272 TraceCheckUtils]: 58: Hoare triple {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:01,831 INFO L290 TraceCheckUtils]: 59: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,831 INFO L290 TraceCheckUtils]: 60: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:01,831 INFO L290 TraceCheckUtils]: 61: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,832 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {20842#true} {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #47#return; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,832 INFO L290 TraceCheckUtils]: 63: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,833 INFO L290 TraceCheckUtils]: 64: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} assume true; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,833 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {21134#(<= 1 |ackermann_#in~m|)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21117#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,834 INFO L290 TraceCheckUtils]: 66: Hoare triple {21117#(<= 2 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {21117#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,834 INFO L290 TraceCheckUtils]: 67: Hoare triple {21117#(<= 2 |ackermann_#in~m|)} assume true; {21117#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,835 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21117#(<= 2 |ackermann_#in~m|)} {21017#(<= ackermann_~m 2)} #47#return; {20843#false} is VALID [2022-02-21 03:26:01,835 INFO L290 TraceCheckUtils]: 69: Hoare triple {20843#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {20843#false} is VALID [2022-02-21 03:26:01,835 INFO L290 TraceCheckUtils]: 70: Hoare triple {20843#false} assume true; {20843#false} is VALID [2022-02-21 03:26:01,835 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20843#false} {20842#true} #43#return; {20843#false} is VALID [2022-02-21 03:26:01,835 INFO L290 TraceCheckUtils]: 72: Hoare triple {20843#false} #res := #t~ret4;havoc #t~ret4; {20843#false} is VALID [2022-02-21 03:26:01,836 INFO L290 TraceCheckUtils]: 73: Hoare triple {20843#false} assume true; {20843#false} is VALID [2022-02-21 03:26:01,836 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20843#false} {20842#true} #45#return; {20843#false} is VALID [2022-02-21 03:26:01,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {20842#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:01,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:01,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {20842#true} assume !(0 == ~n); {20842#true} is VALID [2022-02-21 03:26:01,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {20842#true} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:01,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:01,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {20842#true} assume 0 == ~n; {20842#true} is VALID [2022-02-21 03:26:01,837 INFO L272 TraceCheckUtils]: 8: Hoare triple {20842#true} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:01,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {20842#true} assume !(0 == ~n); {20842#true} is VALID [2022-02-21 03:26:01,838 INFO L272 TraceCheckUtils]: 12: Hoare triple {20842#true} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:01,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,839 INFO L272 TraceCheckUtils]: 16: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,840 INFO L272 TraceCheckUtils]: 20: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:01,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:01,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {20842#true} assume 0 == ~n; {20842#true} is VALID [2022-02-21 03:26:01,841 INFO L272 TraceCheckUtils]: 24: Hoare triple {20842#true} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:01,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,841 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {20842#true} {20842#true} #43#return; {20842#true} is VALID [2022-02-21 03:26:01,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {20842#true} #res := #t~ret4;havoc #t~ret4; {20842#true} is VALID [2022-02-21 03:26:01,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,842 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20842#true} {21048#(= ackermann_~m |ackermann_#in~m|)} #45#return; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,842 INFO L272 TraceCheckUtils]: 32: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:01,843 INFO L290 TraceCheckUtils]: 33: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,843 INFO L290 TraceCheckUtils]: 34: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {21093#(= |ackermann_#in~m| 0)} assume true; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,844 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21093#(= |ackermann_#in~m| 0)} {21048#(= ackermann_~m |ackermann_#in~m|)} #47#return; {21088#(<= |ackermann_#in~m| 1)} is VALID [2022-02-21 03:26:01,845 INFO L290 TraceCheckUtils]: 37: Hoare triple {21088#(<= |ackermann_#in~m| 1)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {21088#(<= |ackermann_#in~m| 1)} is VALID [2022-02-21 03:26:01,845 INFO L290 TraceCheckUtils]: 38: Hoare triple {21088#(<= |ackermann_#in~m| 1)} assume true; {21088#(<= |ackermann_#in~m| 1)} is VALID [2022-02-21 03:26:01,846 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21088#(<= |ackermann_#in~m| 1)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21072#(<= |ackermann_#in~m| 2)} is VALID [2022-02-21 03:26:01,846 INFO L290 TraceCheckUtils]: 40: Hoare triple {21072#(<= |ackermann_#in~m| 2)} #res := #t~ret4;havoc #t~ret4; {21072#(<= |ackermann_#in~m| 2)} is VALID [2022-02-21 03:26:01,846 INFO L290 TraceCheckUtils]: 41: Hoare triple {21072#(<= |ackermann_#in~m| 2)} assume true; {21072#(<= |ackermann_#in~m| 2)} is VALID [2022-02-21 03:26:01,847 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {21072#(<= |ackermann_#in~m| 2)} {20842#true} #45#return; {21017#(<= ackermann_~m 2)} is VALID [2022-02-21 03:26:01,847 INFO L272 TraceCheckUtils]: 43: Hoare triple {21017#(<= ackermann_~m 2)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:01,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,848 INFO L290 TraceCheckUtils]: 45: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,848 INFO L290 TraceCheckUtils]: 46: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,849 INFO L272 TraceCheckUtils]: 47: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,850 INFO L272 TraceCheckUtils]: 51: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:01,850 INFO L290 TraceCheckUtils]: 52: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,851 INFO L272 TraceCheckUtils]: 55: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:01,851 INFO L290 TraceCheckUtils]: 56: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21048#(= ackermann_~m |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,852 INFO L290 TraceCheckUtils]: 57: Hoare triple {21048#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,852 INFO L290 TraceCheckUtils]: 58: Hoare triple {21093#(= |ackermann_#in~m| 0)} assume true; {21093#(= |ackermann_#in~m| 0)} is VALID [2022-02-21 03:26:01,853 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21093#(= |ackermann_#in~m| 0)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,853 INFO L290 TraceCheckUtils]: 60: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} assume true; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,854 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {21134#(<= 1 |ackermann_#in~m|)} {21048#(= ackermann_~m |ackermann_#in~m|)} #45#return; {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} is VALID [2022-02-21 03:26:01,854 INFO L272 TraceCheckUtils]: 63: Hoare triple {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:01,855 INFO L290 TraceCheckUtils]: 64: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:01,855 INFO L290 TraceCheckUtils]: 65: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:01,855 INFO L290 TraceCheckUtils]: 66: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:01,856 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {20842#true} {21129#(and (<= 1 ackermann_~m) (= ackermann_~m |ackermann_#in~m|))} #47#return; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,856 INFO L290 TraceCheckUtils]: 68: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,856 INFO L290 TraceCheckUtils]: 69: Hoare triple {21134#(<= 1 |ackermann_#in~m|)} assume true; {21134#(<= 1 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,857 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {21134#(<= 1 |ackermann_#in~m|)} {21048#(= ackermann_~m |ackermann_#in~m|)} #43#return; {21117#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,857 INFO L290 TraceCheckUtils]: 71: Hoare triple {21117#(<= 2 |ackermann_#in~m|)} #res := #t~ret4;havoc #t~ret4; {21117#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,858 INFO L290 TraceCheckUtils]: 72: Hoare triple {21117#(<= 2 |ackermann_#in~m|)} assume true; {21117#(<= 2 |ackermann_#in~m|)} is VALID [2022-02-21 03:26:01,858 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {21117#(<= 2 |ackermann_#in~m|)} {21017#(<= ackermann_~m 2)} #47#return; {20843#false} is VALID [2022-02-21 03:26:01,859 INFO L290 TraceCheckUtils]: 74: Hoare triple {20843#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {20843#false} is VALID [2022-02-21 03:26:01,859 INFO L290 TraceCheckUtils]: 75: Hoare triple {20843#false} assume true; {20843#false} is VALID [2022-02-21 03:26:01,859 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {20843#false} {20842#true} #43#return; {20843#false} is VALID [2022-02-21 03:26:01,859 INFO L290 TraceCheckUtils]: 77: Hoare triple {20843#false} #res := #t~ret4;havoc #t~ret4; {20843#false} is VALID [2022-02-21 03:26:01,859 INFO L290 TraceCheckUtils]: 78: Hoare triple {20843#false} assume true; {20843#false} is VALID [2022-02-21 03:26:01,859 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {20843#false} {20842#true} #45#return; {20843#false} is VALID [2022-02-21 03:26:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 152 proven. 59 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-02-21 03:26:01,860 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:26:01,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239219141] [2022-02-21 03:26:01,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239219141] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:26:01,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102682462] [2022-02-21 03:26:01,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:26:01,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:26:01,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:01,863 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:26:01,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-02-21 03:26:01,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:26:01,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:26:01,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 03:26:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:01,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:02,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {20842#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:02,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:02,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:02,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {20842#true} assume !(0 == ~n); {20842#true} is VALID [2022-02-21 03:26:02,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {20842#true} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:02,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:02,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:02,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {20842#true} assume 0 == ~n; {20842#true} is VALID [2022-02-21 03:26:02,341 INFO L272 TraceCheckUtils]: 8: Hoare triple {20842#true} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:02,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:02,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:02,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {20842#true} assume !(0 == ~n); {20842#true} is VALID [2022-02-21 03:26:02,342 INFO L272 TraceCheckUtils]: 12: Hoare triple {20842#true} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:02,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:02,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:02,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {20842#true} assume 0 == ~n; {20842#true} is VALID [2022-02-21 03:26:02,342 INFO L272 TraceCheckUtils]: 16: Hoare triple {20842#true} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:02,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:02,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:02,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {20842#true} assume !(0 == ~n); {20842#true} is VALID [2022-02-21 03:26:02,343 INFO L272 TraceCheckUtils]: 20: Hoare triple {20842#true} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:02,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:02,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:02,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {20842#true} assume 0 == ~n; {20842#true} is VALID [2022-02-21 03:26:02,343 INFO L272 TraceCheckUtils]: 24: Hoare triple {20842#true} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:02,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21217#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:02,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {21217#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {21221#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:02,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {21221#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {21221#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:02,345 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {21221#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {20842#true} #43#return; {21228#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:02,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {21228#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {21232#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:02,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {21232#(<= 2 |ackermann_#res|)} assume true; {21232#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:02,347 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21232#(<= 2 |ackermann_#res|)} {20842#true} #45#return; {21239#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:02,347 INFO L272 TraceCheckUtils]: 32: Hoare triple {21239#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:02,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21217#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:02,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {21217#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {21221#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:02,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {21221#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {21221#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:02,349 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21221#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {21239#(<= 2 |ackermann_#t~ret5|)} #47#return; {21255#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:02,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {21255#(<= 3 |ackermann_#t~ret6|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {21259#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:02,350 INFO L290 TraceCheckUtils]: 38: Hoare triple {21259#(<= 3 |ackermann_#res|)} assume true; {21259#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:02,351 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21259#(<= 3 |ackermann_#res|)} {20842#true} #43#return; {21266#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:02,351 INFO L290 TraceCheckUtils]: 40: Hoare triple {21266#(<= 3 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {21259#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:02,352 INFO L290 TraceCheckUtils]: 41: Hoare triple {21259#(<= 3 |ackermann_#res|)} assume true; {21259#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:02,353 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {21259#(<= 3 |ackermann_#res|)} {20842#true} #45#return; {21276#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:02,353 INFO L272 TraceCheckUtils]: 43: Hoare triple {21276#(<= 3 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:02,353 INFO L290 TraceCheckUtils]: 44: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21217#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:02,354 INFO L290 TraceCheckUtils]: 45: Hoare triple {21217#(<= |ackermann_#in~n| ackermann_~n)} assume !(0 == ~m); {21217#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:02,354 INFO L290 TraceCheckUtils]: 46: Hoare triple {21217#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~n; {21289#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:02,354 INFO L272 TraceCheckUtils]: 47: Hoare triple {21289#(<= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:02,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:02,354 INFO L290 TraceCheckUtils]: 49: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:02,355 INFO L290 TraceCheckUtils]: 50: Hoare triple {20842#true} assume !(0 == ~n); {20842#true} is VALID [2022-02-21 03:26:02,355 INFO L272 TraceCheckUtils]: 51: Hoare triple {20842#true} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:02,355 INFO L290 TraceCheckUtils]: 52: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:02,355 INFO L290 TraceCheckUtils]: 53: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:02,355 INFO L290 TraceCheckUtils]: 54: Hoare triple {20842#true} assume 0 == ~n; {20842#true} is VALID [2022-02-21 03:26:02,355 INFO L272 TraceCheckUtils]: 55: Hoare triple {20842#true} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:02,355 INFO L290 TraceCheckUtils]: 56: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:02,356 INFO L290 TraceCheckUtils]: 57: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:02,356 INFO L290 TraceCheckUtils]: 58: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:02,356 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20842#true} {20842#true} #43#return; {20842#true} is VALID [2022-02-21 03:26:02,356 INFO L290 TraceCheckUtils]: 60: Hoare triple {20842#true} #res := #t~ret4;havoc #t~ret4; {20842#true} is VALID [2022-02-21 03:26:02,356 INFO L290 TraceCheckUtils]: 61: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:02,356 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {20842#true} {20842#true} #45#return; {20842#true} is VALID [2022-02-21 03:26:02,356 INFO L272 TraceCheckUtils]: 63: Hoare triple {20842#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:02,356 INFO L290 TraceCheckUtils]: 64: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:02,357 INFO L290 TraceCheckUtils]: 65: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:02,357 INFO L290 TraceCheckUtils]: 66: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:02,357 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {20842#true} {20842#true} #47#return; {20842#true} is VALID [2022-02-21 03:26:02,357 INFO L290 TraceCheckUtils]: 68: Hoare triple {20842#true} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {20842#true} is VALID [2022-02-21 03:26:02,357 INFO L290 TraceCheckUtils]: 69: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:02,358 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {20842#true} {21289#(<= |ackermann_#in~n| 0)} #43#return; {21289#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:02,358 INFO L290 TraceCheckUtils]: 71: Hoare triple {21289#(<= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {21289#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:02,359 INFO L290 TraceCheckUtils]: 72: Hoare triple {21289#(<= |ackermann_#in~n| 0)} assume true; {21289#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:02,360 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {21289#(<= |ackermann_#in~n| 0)} {21276#(<= 3 |ackermann_#t~ret5|)} #47#return; {20843#false} is VALID [2022-02-21 03:26:02,360 INFO L290 TraceCheckUtils]: 74: Hoare triple {20843#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {20843#false} is VALID [2022-02-21 03:26:02,360 INFO L290 TraceCheckUtils]: 75: Hoare triple {20843#false} assume true; {20843#false} is VALID [2022-02-21 03:26:02,360 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {20843#false} {20842#true} #43#return; {20843#false} is VALID [2022-02-21 03:26:02,360 INFO L290 TraceCheckUtils]: 77: Hoare triple {20843#false} #res := #t~ret4;havoc #t~ret4; {20843#false} is VALID [2022-02-21 03:26:02,361 INFO L290 TraceCheckUtils]: 78: Hoare triple {20843#false} assume true; {20843#false} is VALID [2022-02-21 03:26:02,361 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {20843#false} {20842#true} #45#return; {20843#false} is VALID [2022-02-21 03:26:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 90 proven. 84 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-02-21 03:26:02,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:26:06,865 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {20843#false} {20842#true} #45#return; {20843#false} is VALID [2022-02-21 03:26:06,865 INFO L290 TraceCheckUtils]: 78: Hoare triple {20843#false} assume true; {20843#false} is VALID [2022-02-21 03:26:06,865 INFO L290 TraceCheckUtils]: 77: Hoare triple {20843#false} #res := #t~ret4;havoc #t~ret4; {20843#false} is VALID [2022-02-21 03:26:06,865 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {20843#false} {20842#true} #43#return; {20843#false} is VALID [2022-02-21 03:26:06,865 INFO L290 TraceCheckUtils]: 75: Hoare triple {20843#false} assume true; {20843#false} is VALID [2022-02-21 03:26:06,865 INFO L290 TraceCheckUtils]: 74: Hoare triple {20843#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {20843#false} is VALID [2022-02-21 03:26:06,866 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {21289#(<= |ackermann_#in~n| 0)} {21413#(< 0 |ackermann_#t~ret5|)} #47#return; {20843#false} is VALID [2022-02-21 03:26:06,866 INFO L290 TraceCheckUtils]: 72: Hoare triple {21289#(<= |ackermann_#in~n| 0)} assume true; {21289#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:06,866 INFO L290 TraceCheckUtils]: 71: Hoare triple {21289#(<= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {21289#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:06,867 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {20842#true} {21289#(<= |ackermann_#in~n| 0)} #43#return; {21289#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:06,867 INFO L290 TraceCheckUtils]: 69: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:06,867 INFO L290 TraceCheckUtils]: 68: Hoare triple {20842#true} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {20842#true} is VALID [2022-02-21 03:26:06,867 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {20842#true} {20842#true} #47#return; {20842#true} is VALID [2022-02-21 03:26:06,867 INFO L290 TraceCheckUtils]: 66: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:06,867 INFO L290 TraceCheckUtils]: 65: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:06,867 INFO L290 TraceCheckUtils]: 64: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:06,867 INFO L272 TraceCheckUtils]: 63: Hoare triple {20842#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:06,867 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {20842#true} {20842#true} #45#return; {20842#true} is VALID [2022-02-21 03:26:06,867 INFO L290 TraceCheckUtils]: 61: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:06,867 INFO L290 TraceCheckUtils]: 60: Hoare triple {20842#true} #res := #t~ret4;havoc #t~ret4; {20842#true} is VALID [2022-02-21 03:26:06,868 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20842#true} {20842#true} #43#return; {20842#true} is VALID [2022-02-21 03:26:06,868 INFO L290 TraceCheckUtils]: 58: Hoare triple {20842#true} assume true; {20842#true} is VALID [2022-02-21 03:26:06,868 INFO L290 TraceCheckUtils]: 57: Hoare triple {20842#true} assume 0 == ~m;#res := 1 + ~n; {20842#true} is VALID [2022-02-21 03:26:06,868 INFO L290 TraceCheckUtils]: 56: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:06,868 INFO L272 TraceCheckUtils]: 55: Hoare triple {20842#true} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:06,868 INFO L290 TraceCheckUtils]: 54: Hoare triple {20842#true} assume 0 == ~n; {20842#true} is VALID [2022-02-21 03:26:06,868 INFO L290 TraceCheckUtils]: 53: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:06,868 INFO L290 TraceCheckUtils]: 52: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:06,868 INFO L272 TraceCheckUtils]: 51: Hoare triple {20842#true} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:06,868 INFO L290 TraceCheckUtils]: 50: Hoare triple {20842#true} assume !(0 == ~n); {20842#true} is VALID [2022-02-21 03:26:06,868 INFO L290 TraceCheckUtils]: 49: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:06,868 INFO L290 TraceCheckUtils]: 48: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:06,868 INFO L272 TraceCheckUtils]: 47: Hoare triple {21289#(<= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:06,869 INFO L290 TraceCheckUtils]: 46: Hoare triple {21498#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} assume 0 == ~n; {21289#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:06,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {21498#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} assume !(0 == ~m); {21498#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} is VALID [2022-02-21 03:26:06,870 INFO L290 TraceCheckUtils]: 44: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21498#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} is VALID [2022-02-21 03:26:06,870 INFO L272 TraceCheckUtils]: 43: Hoare triple {21413#(< 0 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:06,870 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {21511#(< 0 |ackermann_#res|)} {20842#true} #45#return; {21413#(< 0 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:06,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {21511#(< 0 |ackermann_#res|)} assume true; {21511#(< 0 |ackermann_#res|)} is VALID [2022-02-21 03:26:06,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {21518#(< 0 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {21511#(< 0 |ackermann_#res|)} is VALID [2022-02-21 03:26:06,871 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21511#(< 0 |ackermann_#res|)} {20842#true} #43#return; {21518#(< 0 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:06,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {21511#(< 0 |ackermann_#res|)} assume true; {21511#(< 0 |ackermann_#res|)} is VALID [2022-02-21 03:26:06,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {21531#(< 0 |ackermann_#t~ret6|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {21511#(< 0 |ackermann_#res|)} is VALID [2022-02-21 03:26:06,873 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21539#(or (<= (+ |ackermann_#in~n| 1) 0) (< 0 |ackermann_#res|))} {21535#(< 0 (+ |ackermann_#t~ret5| 1))} #47#return; {21531#(< 0 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:06,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {21539#(or (<= (+ |ackermann_#in~n| 1) 0) (< 0 |ackermann_#res|))} assume true; {21539#(or (<= (+ |ackermann_#in~n| 1) 0) (< 0 |ackermann_#res|))} is VALID [2022-02-21 03:26:06,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {21546#(or (< 0 (+ ackermann_~n 1)) (<= (+ |ackermann_#in~n| 1) 0))} assume 0 == ~m;#res := 1 + ~n; {21539#(or (<= (+ |ackermann_#in~n| 1) 0) (< 0 |ackermann_#res|))} is VALID [2022-02-21 03:26:06,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21546#(or (< 0 (+ ackermann_~n 1)) (<= (+ |ackermann_#in~n| 1) 0))} is VALID [2022-02-21 03:26:06,874 INFO L272 TraceCheckUtils]: 32: Hoare triple {21535#(< 0 (+ |ackermann_#t~ret5| 1))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:06,875 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21556#(< 0 (+ |ackermann_#res| 1))} {20842#true} #45#return; {21535#(< 0 (+ |ackermann_#t~ret5| 1))} is VALID [2022-02-21 03:26:06,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {21556#(< 0 (+ |ackermann_#res| 1))} assume true; {21556#(< 0 (+ |ackermann_#res| 1))} is VALID [2022-02-21 03:26:06,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {21563#(< 0 (+ |ackermann_#t~ret4| 1))} #res := #t~ret4;havoc #t~ret4; {21556#(< 0 (+ |ackermann_#res| 1))} is VALID [2022-02-21 03:26:06,876 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {21570#(or (not (<= 1 |ackermann_#in~n|)) (< 0 (+ |ackermann_#res| 1)))} {20842#true} #43#return; {21563#(< 0 (+ |ackermann_#t~ret4| 1))} is VALID [2022-02-21 03:26:06,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {21570#(or (not (<= 1 |ackermann_#in~n|)) (< 0 (+ |ackermann_#res| 1)))} assume true; {21570#(or (not (<= 1 |ackermann_#in~n|)) (< 0 (+ |ackermann_#res| 1)))} is VALID [2022-02-21 03:26:06,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {21577#(or (not (<= 1 |ackermann_#in~n|)) (< 0 (+ ackermann_~n 2)))} assume 0 == ~m;#res := 1 + ~n; {21570#(or (not (<= 1 |ackermann_#in~n|)) (< 0 (+ |ackermann_#res| 1)))} is VALID [2022-02-21 03:26:06,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {21577#(or (not (<= 1 |ackermann_#in~n|)) (< 0 (+ ackermann_~n 2)))} is VALID [2022-02-21 03:26:06,877 INFO L272 TraceCheckUtils]: 24: Hoare triple {20842#true} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:06,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {20842#true} assume 0 == ~n; {20842#true} is VALID [2022-02-21 03:26:06,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:06,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:06,877 INFO L272 TraceCheckUtils]: 20: Hoare triple {20842#true} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:06,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {20842#true} assume !(0 == ~n); {20842#true} is VALID [2022-02-21 03:26:06,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:06,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:06,877 INFO L272 TraceCheckUtils]: 16: Hoare triple {20842#true} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:06,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {20842#true} assume 0 == ~n; {20842#true} is VALID [2022-02-21 03:26:06,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:06,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:06,878 INFO L272 TraceCheckUtils]: 12: Hoare triple {20842#true} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:06,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {20842#true} assume !(0 == ~n); {20842#true} is VALID [2022-02-21 03:26:06,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:06,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:06,878 INFO L272 TraceCheckUtils]: 8: Hoare triple {20842#true} call #t~ret4 := ackermann(~m - 1, 1); {20842#true} is VALID [2022-02-21 03:26:06,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {20842#true} assume 0 == ~n; {20842#true} is VALID [2022-02-21 03:26:06,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:06,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:06,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {20842#true} call #t~ret5 := ackermann(~m, ~n - 1); {20842#true} is VALID [2022-02-21 03:26:06,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {20842#true} assume !(0 == ~n); {20842#true} is VALID [2022-02-21 03:26:06,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {20842#true} assume !(0 == ~m); {20842#true} is VALID [2022-02-21 03:26:06,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {20842#true} ~m := #in~m;~n := #in~n; {20842#true} is VALID [2022-02-21 03:26:06,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {20842#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {20842#true} is VALID [2022-02-21 03:26:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 106 proven. 73 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-21 03:26:06,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102682462] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:26:06,879 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:26:06,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 15] total 32 [2022-02-21 03:26:06,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873231416] [2022-02-21 03:26:06,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:26:06,882 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:26:06,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:26:06,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-21 03:26:06,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2022-02-21 03:26:06,883 INFO L87 Difference]: Start difference. First operand 137 states and 184 transitions. cyclomatic complexity: 51 Second operand has 32 states, 26 states have (on average 2.0) internal successors, (52), 20 states have internal predecessors, (52), 9 states have call successors, (13), 1 states have call predecessors, (13), 15 states have return successors, (27), 20 states have call predecessors, (27), 9 states have call successors, (27) [2022-02-21 03:26:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:26:09,388 INFO L93 Difference]: Finished difference Result 177 states and 270 transitions. [2022-02-21 03:26:09,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-21 03:26:09,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 32 states, 26 states have (on average 2.0) internal successors, (52), 20 states have internal predecessors, (52), 9 states have call successors, (13), 1 states have call predecessors, (13), 15 states have return successors, (27), 20 states have call predecessors, (27), 9 states have call successors, (27) [2022-02-21 03:26:09,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:26:09,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 270 transitions. [2022-02-21 03:26:09,486 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 [2022-02-21 03:26:09,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 176 states and 262 transitions. [2022-02-21 03:26:09,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2022-02-21 03:26:09,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2022-02-21 03:26:09,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 176 states and 262 transitions. [2022-02-21 03:26:09,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:26:09,497 INFO L681 BuchiCegarLoop]: Abstraction has 176 states and 262 transitions. [2022-02-21 03:26:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states and 262 transitions. [2022-02-21 03:26:09,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2022-02-21 03:26:09,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:26:09,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states and 262 transitions. Second operand has 165 states, 109 states have (on average 1.0825688073394495) internal successors, (118), 113 states have internal predecessors, (118), 35 states have call successors, (40), 23 states have call predecessors, (40), 21 states have return successors, (88), 28 states have call predecessors, (88), 30 states have call successors, (88) [2022-02-21 03:26:09,502 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states and 262 transitions. Second operand has 165 states, 109 states have (on average 1.0825688073394495) internal successors, (118), 113 states have internal predecessors, (118), 35 states have call successors, (40), 23 states have call predecessors, (40), 21 states have return successors, (88), 28 states have call predecessors, (88), 30 states have call successors, (88) [2022-02-21 03:26:09,502 INFO L87 Difference]: Start difference. First operand 176 states and 262 transitions. Second operand has 165 states, 109 states have (on average 1.0825688073394495) internal successors, (118), 113 states have internal predecessors, (118), 35 states have call successors, (40), 23 states have call predecessors, (40), 21 states have return successors, (88), 28 states have call predecessors, (88), 30 states have call successors, (88) [2022-02-21 03:26:09,502 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:09,528 INFO L93 Difference]: Finished difference Result 625 states and 842 transitions. [2022-02-21 03:26:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 842 transitions. [2022-02-21 03:26:09,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:09,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:09,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 109 states have (on average 1.0825688073394495) internal successors, (118), 113 states have internal predecessors, (118), 35 states have call successors, (40), 23 states have call predecessors, (40), 21 states have return successors, (88), 28 states have call predecessors, (88), 30 states have call successors, (88) Second operand 176 states and 262 transitions. [2022-02-21 03:26:09,533 INFO L87 Difference]: Start difference. First operand has 165 states, 109 states have (on average 1.0825688073394495) internal successors, (118), 113 states have internal predecessors, (118), 35 states have call successors, (40), 23 states have call predecessors, (40), 21 states have return successors, (88), 28 states have call predecessors, (88), 30 states have call successors, (88) Second operand 176 states and 262 transitions. [2022-02-21 03:26:09,533 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:09,569 INFO L93 Difference]: Finished difference Result 625 states and 842 transitions. [2022-02-21 03:26:09,569 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 842 transitions. [2022-02-21 03:26:09,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:09,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:09,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:26:09,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:26:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 109 states have (on average 1.0825688073394495) internal successors, (118), 113 states have internal predecessors, (118), 35 states have call successors, (40), 23 states have call predecessors, (40), 21 states have return successors, (88), 28 states have call predecessors, (88), 30 states have call successors, (88) [2022-02-21 03:26:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2022-02-21 03:26:09,578 INFO L704 BuchiCegarLoop]: Abstraction has 165 states and 246 transitions. [2022-02-21 03:26:09,578 INFO L587 BuchiCegarLoop]: Abstraction has 165 states and 246 transitions. [2022-02-21 03:26:09,578 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2022-02-21 03:26:09,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 246 transitions. [2022-02-21 03:26:09,579 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 [2022-02-21 03:26:09,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:09,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:09,580 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:26:09,580 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:26:09,580 INFO L791 eck$LassoCheckResult]: Stem: 21864#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 21865#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 21880#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 21881#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 21882#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 21883#ackermannENTRY ~m := #in~m;~n := #in~n; 21925#L17 assume !(0 == ~m); 21923#L20 assume !(0 == ~n); 21919#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 21918#ackermannENTRY ~m := #in~m;~n := #in~n; 21920#L17 assume !(0 == ~m); 21988#L20 assume 0 == ~n; 21913#L21 call #t~ret4 := ackermann(~m - 1, 1);< 21963#ackermannENTRY ~m := #in~m;~n := #in~n; 22012#L17 assume !(0 == ~m); 21965#L20 assume !(0 == ~n); 21952#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 21954#ackermannENTRY ~m := #in~m;~n := #in~n; 22007#L17 assume !(0 == ~m); 21916#L20 assume 0 == ~n; 21949#L21 call #t~ret4 := ackermann(~m - 1, 1);< 21962#ackermannENTRY ~m := #in~m;~n := #in~n; 22025#L17 assume 0 == ~m;#res := 1 + ~n; 22024#ackermannFINAL assume true; 22021#ackermannEXIT >#43#return; 22020#L21-1 #res := #t~ret4;havoc #t~ret4; 22019#ackermannFINAL assume true; 22016#ackermannEXIT >#45#return; 22014#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 22015#ackermannENTRY ~m := #in~m;~n := #in~n; 22018#L17 assume 0 == ~m;#res := 1 + ~n; 22017#ackermannFINAL assume true; 22013#ackermannEXIT >#47#return; 22002#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 21975#ackermannFINAL assume true; 21970#ackermannEXIT >#43#return; 21971#L21-1 #res := #t~ret4;havoc #t~ret4; 21966#ackermannFINAL assume true; 21955#ackermannEXIT >#45#return; 21896#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 21908#ackermannENTRY [2022-02-21 03:26:09,580 INFO L793 eck$LassoCheckResult]: Loop: 21908#ackermannENTRY ~m := #in~m;~n := #in~n; 21930#L17 assume !(0 == ~m); 21931#L20 assume !(0 == ~n); 21895#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 21908#ackermannENTRY [2022-02-21 03:26:09,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:09,581 INFO L85 PathProgramCache]: Analyzing trace with hash -235246462, now seen corresponding path program 3 times [2022-02-21 03:26:09,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:09,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203850660] [2022-02-21 03:26:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:09,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:09,591 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:09,605 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:09,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:09,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1697294, now seen corresponding path program 5 times [2022-02-21 03:26:09,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:09,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410964705] [2022-02-21 03:26:09,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:09,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:09,610 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:09,613 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:09,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:09,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1578641935, now seen corresponding path program 4 times [2022-02-21 03:26:09,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:09,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664017345] [2022-02-21 03:26:09,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:09,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:09,624 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:09,634 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:09,702 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:26:09,702 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:26:09,702 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:26:09,702 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:26:09,702 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:26:09,702 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:09,703 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:26:09,703 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:26:09,703 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration11_Loop [2022-02-21 03:26:09,703 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:26:09,703 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:26:09,704 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:26:09,706 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:26:09,708 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:26:09,713 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:26:09,716 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:26:09,718 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:26:09,723 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:26:09,725 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:26:09,815 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:26:09,815 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:26:09,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:09,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:09,818 INFO L229 MonitoredProcess]: Starting monitored process 128 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:26:09,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:09,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:09,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2022-02-21 03:26:09,846 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:26:09,847 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:26:09,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:09,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:09,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:09,872 INFO L229 MonitoredProcess]: Starting monitored process 129 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:26:09,875 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:09,875 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:09,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2022-02-21 03:26:09,896 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:26:09,896 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:26:09,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:09,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:09,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:09,919 INFO L229 MonitoredProcess]: Starting monitored process 130 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:26:09,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2022-02-21 03:26:09,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:09,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:09,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2022-02-21 03:26:09,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:09,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:09,966 INFO L229 MonitoredProcess]: Starting monitored process 131 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:26:09,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2022-02-21 03:26:09,968 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:26:09,968 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:10,016 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:26:10,017 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=-4} Honda state: {ackermann_#in~n=-4} Generalized eigenvectors: [{ackermann_#in~n=-1}, {ackermann_#in~n=0}, {ackermann_#in~n=0}] Lambdas: [1, 1, 1] Nus: [1, 0] [2022-02-21 03:26:10,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:10,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:10,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:10,033 INFO L229 MonitoredProcess]: Starting monitored process 132 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:26:10,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-02-21 03:26:10,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:10,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:10,041 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:26:10,041 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:26:10,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2022-02-21 03:26:10,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:10,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:10,056 INFO L229 MonitoredProcess]: Starting monitored process 133 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:26:10,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-02-21 03:26:10,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:10,058 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:10,063 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:26:10,064 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:26:10,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:10,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:10,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:10,079 INFO L229 MonitoredProcess]: Starting monitored process 134 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:26:10,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-02-21 03:26:10,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:10,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:10,090 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:26:10,090 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=4} Honda state: {ackermann_#in~m=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:26:10,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2022-02-21 03:26:10,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:10,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:10,106 INFO L229 MonitoredProcess]: Starting monitored process 135 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:26:10,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-02-21 03:26:10,107 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:10,107 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:10,113 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:26:10,113 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:26:10,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:10,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:10,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:10,129 INFO L229 MonitoredProcess]: Starting monitored process 136 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:26:10,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-02-21 03:26:10,130 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:10,131 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:10,136 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:26:10,136 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:26:10,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:11,042 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:26:11,042 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:26:11,042 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:26:11,042 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:26:11,042 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:26:11,042 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,042 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:26:11,043 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:26:11,043 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration11_Lasso [2022-02-21 03:26:11,043 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:26:11,043 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:26:11,044 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:26:11,046 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:26:11,049 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:26:11,055 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:26:11,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:26:11,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:26:11,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:26:11,062 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:26:11,066 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:26:11,068 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:26:11,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:26:11,071 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:26:11,073 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:26:11,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:26:11,076 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:26:11,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:26:11,080 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:26:11,088 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:26:11,090 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:26:11,103 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:26:11,104 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:26:11,106 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:26:11,108 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:26:11,118 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:26:11,360 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:26:11,360 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:26:11,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,361 INFO L229 MonitoredProcess]: Starting monitored process 137 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:26:11,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-02-21 03:26:11,363 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:26:11,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:11,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:11,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:11,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:11,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2022-02-21 03:26:11,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,386 INFO L229 MonitoredProcess]: Starting monitored process 138 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:26:11,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-02-21 03:26:11,388 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:26:11,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:11,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:26:11,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:26:11,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2022-02-21 03:26:11,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,419 INFO L229 MonitoredProcess]: Starting monitored process 139 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:26:11,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-02-21 03:26:11,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:26:11,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:11,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:26:11,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:26:11,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2022-02-21 03:26:11,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,445 INFO L229 MonitoredProcess]: Starting monitored process 140 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:26:11,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-02-21 03:26:11,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:26:11,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:11,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:26:11,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:26:11,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2022-02-21 03:26:11,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,472 INFO L229 MonitoredProcess]: Starting monitored process 141 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:26:11,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-02-21 03:26:11,474 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:26:11,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:11,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:11,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:11,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:11,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2022-02-21 03:26:11,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,496 INFO L229 MonitoredProcess]: Starting monitored process 142 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:26:11,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-02-21 03:26:11,498 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:26:11,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:11,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:11,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:11,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:11,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2022-02-21 03:26:11,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,521 INFO L229 MonitoredProcess]: Starting monitored process 143 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:26:11,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2022-02-21 03:26:11,522 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:26:11,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:11,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:11,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:11,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:11,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2022-02-21 03:26:11,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,545 INFO L229 MonitoredProcess]: Starting monitored process 144 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:26:11,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2022-02-21 03:26:11,547 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:26:11,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:11,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:11,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:11,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:11,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2022-02-21 03:26:11,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,570 INFO L229 MonitoredProcess]: Starting monitored process 145 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:26:11,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2022-02-21 03:26:11,572 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:26:11,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,578 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:26:11,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,582 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 03:26:11,582 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:26:11,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2022-02-21 03:26:11,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,606 INFO L229 MonitoredProcess]: Starting monitored process 146 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:26:11,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2022-02-21 03:26:11,608 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:26:11,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:11,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:11,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:11,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:11,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2022-02-21 03:26:11,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,631 INFO L229 MonitoredProcess]: Starting monitored process 147 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:26:11,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2022-02-21 03:26:11,632 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:26:11,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:11,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:11,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:11,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:11,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2022-02-21 03:26:11,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,654 INFO L229 MonitoredProcess]: Starting monitored process 148 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:26:11,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2022-02-21 03:26:11,656 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:26:11,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:11,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:26:11,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:26:11,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2022-02-21 03:26:11,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,684 INFO L229 MonitoredProcess]: Starting monitored process 149 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:26:11,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2022-02-21 03:26:11,686 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:26:11,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:11,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:11,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:11,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:11,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2022-02-21 03:26:11,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,709 INFO L229 MonitoredProcess]: Starting monitored process 150 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:26:11,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2022-02-21 03:26:11,710 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:26:11,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:11,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:11,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:11,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:11,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2022-02-21 03:26:11,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,733 INFO L229 MonitoredProcess]: Starting monitored process 151 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:26:11,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2022-02-21 03:26:11,735 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:26:11,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:11,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:11,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:11,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:11,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2022-02-21 03:26:11,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,757 INFO L229 MonitoredProcess]: Starting monitored process 152 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:26:11,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2022-02-21 03:26:11,759 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:26:11,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:11,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:26:11,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:26:11,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:11,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,783 INFO L229 MonitoredProcess]: Starting monitored process 153 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:26:11,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2022-02-21 03:26:11,785 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:26:11,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:11,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:11,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:11,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:11,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:11,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2022-02-21 03:26:11,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,808 INFO L229 MonitoredProcess]: Starting monitored process 154 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:26:11,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2022-02-21 03:26:11,809 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:26:11,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:11,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:11,815 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:26:11,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:11,818 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 03:26:11,818 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:26:11,826 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:26:11,839 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-02-21 03:26:11,839 INFO L444 ModelExtractionUtils]: 0 out of 11 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-02-21 03:26:11,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:11,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:11,840 INFO L229 MonitoredProcess]: Starting monitored process 155 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:26:11,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2022-02-21 03:26:11,842 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:26:11,849 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-02-21 03:26:11,849 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:26:11,849 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~n) = 1*ackermann_#in~n Supporting invariants [1*ackermann_#in~n >= 0] [2022-02-21 03:26:11,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:11,872 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2022-02-21 03:26:11,876 INFO L390 LassoCheck]: Loop: "~m := #in~m;~n := #in~n;" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret5 := ackermann(~m, ~n - 1);"< [2022-02-21 03:26:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:11,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:11,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-21 03:26:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:11,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:12,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2022-02-21 03:26:12,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {24457#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {24457#unseeded} is VALID [2022-02-21 03:26:12,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {24457#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {24457#unseeded} is VALID [2022-02-21 03:26:12,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {24457#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {24457#unseeded} is VALID [2022-02-21 03:26:12,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {24457#unseeded} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {24457#unseeded} is VALID [2022-02-21 03:26:12,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {24457#unseeded} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {24457#unseeded} is VALID [2022-02-21 03:26:12,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {24457#unseeded} ~m := #in~m;~n := #in~n; {24457#unseeded} is VALID [2022-02-21 03:26:12,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {24457#unseeded} assume !(0 == ~m); {24457#unseeded} is VALID [2022-02-21 03:26:12,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {24457#unseeded} assume !(0 == ~n); {24457#unseeded} is VALID [2022-02-21 03:26:12,609 INFO L272 TraceCheckUtils]: 8: Hoare triple {24457#unseeded} call #t~ret5 := ackermann(~m, ~n - 1); {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:12,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:12,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~m); {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:12,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~n; {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:12,610 INFO L272 TraceCheckUtils]: 12: Hoare triple {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := ackermann(~m - 1, 1); {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:12,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:12,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~m); {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:12,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~n); {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:12,612 INFO L272 TraceCheckUtils]: 16: Hoare triple {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := ackermann(~m, ~n - 1); {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:12,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:12,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~m); {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:12,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~n; {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:12,614 INFO L272 TraceCheckUtils]: 20: Hoare triple {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := ackermann(~m - 1, 1); {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:12,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {24554#(and (<= |ackermann_#in~n| ackermann_~n) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} is VALID [2022-02-21 03:26:12,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {24554#(and (<= |ackermann_#in~n| ackermann_~n) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} assume 0 == ~m;#res := 1 + ~n; {24558#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} is VALID [2022-02-21 03:26:12,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {24558#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} assume true; {24558#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} is VALID [2022-02-21 03:26:12,616 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {24558#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #43#return; {24565#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 2 |ackermann_#t~ret4|))} is VALID [2022-02-21 03:26:12,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {24565#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 2 |ackermann_#t~ret4|))} #res := #t~ret4;havoc #t~ret4; {24569#(and (<= 2 |ackermann_#res|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} is VALID [2022-02-21 03:26:12,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {24569#(and (<= 2 |ackermann_#res|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} assume true; {24569#(and (<= 2 |ackermann_#res|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} is VALID [2022-02-21 03:26:12,617 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {24569#(and (<= 2 |ackermann_#res|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #45#return; {24576#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 2 |ackermann_#t~ret5|))} is VALID [2022-02-21 03:26:12,618 INFO L272 TraceCheckUtils]: 28: Hoare triple {24576#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 2 |ackermann_#t~ret5|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:12,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {24554#(and (<= |ackermann_#in~n| ackermann_~n) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} is VALID [2022-02-21 03:26:12,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {24554#(and (<= |ackermann_#in~n| ackermann_~n) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} assume 0 == ~m;#res := 1 + ~n; {24558#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} is VALID [2022-02-21 03:26:12,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {24558#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} assume true; {24558#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} is VALID [2022-02-21 03:26:12,620 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {24558#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} {24576#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 2 |ackermann_#t~ret5|))} #47#return; {24592#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#t~ret6|))} is VALID [2022-02-21 03:26:12,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {24592#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#t~ret6|))} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {24596#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} is VALID [2022-02-21 03:26:12,621 INFO L290 TraceCheckUtils]: 34: Hoare triple {24596#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} assume true; {24596#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} is VALID [2022-02-21 03:26:12,622 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {24596#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} {24514#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #43#return; {24603#(and (<= 3 |ackermann_#t~ret4|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} is VALID [2022-02-21 03:26:12,622 INFO L290 TraceCheckUtils]: 36: Hoare triple {24603#(and (<= 3 |ackermann_#t~ret4|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} #res := #t~ret4;havoc #t~ret4; {24596#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} is VALID [2022-02-21 03:26:12,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {24596#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} assume true; {24596#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} is VALID [2022-02-21 03:26:12,623 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {24596#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} {24457#unseeded} #45#return; {24613#(and (<= 3 |ackermann_#t~ret5|) unseeded)} is VALID [2022-02-21 03:26:12,624 INFO L272 TraceCheckUtils]: 39: Hoare triple {24613#(and (<= 3 |ackermann_#t~ret5|) unseeded)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {24481#(and (>= |ackermann_#in~n| 0) unseeded)} is VALID [2022-02-21 03:26:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:12,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:26:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:12,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:12,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {24482#(and (>= oldRank0 |ackermann_#in~n|) (>= |ackermann_#in~n| 0))} ~m := #in~m;~n := #in~n; {24617#(and (<= 0 ackermann_~n) (<= ackermann_~n oldRank0))} is VALID [2022-02-21 03:26:12,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {24617#(and (<= 0 ackermann_~n) (<= ackermann_~n oldRank0))} assume !(0 == ~m); {24617#(and (<= 0 ackermann_~n) (<= ackermann_~n oldRank0))} is VALID [2022-02-21 03:26:12,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {24617#(and (<= 0 ackermann_~n) (<= ackermann_~n oldRank0))} assume !(0 == ~n); {24624#(and (<= 0 ackermann_~n) (not (= ackermann_~n 0)) (<= ackermann_~n oldRank0))} is VALID [2022-02-21 03:26:12,691 INFO L272 TraceCheckUtils]: 3: Hoare triple {24624#(and (<= 0 ackermann_~n) (not (= ackermann_~n 0)) (<= ackermann_~n oldRank0))} call #t~ret5 := ackermann(~m, ~n - 1); {24484#(and (>= |ackermann_#in~n| 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 |ackermann_#in~n|))))} is VALID [2022-02-21 03:26:12,691 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:26:12,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:26:12,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:26:12,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:12,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:12,723 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 3 loop predicates [2022-02-21 03:26:12,723 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 246 transitions. cyclomatic complexity: 86 Second operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:26:13,101 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 246 transitions. cyclomatic complexity: 86. Second operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Result 169 states and 255 transitions. Complement of second has 13 states. [2022-02-21 03:26:13,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 7 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:26:13,102 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:13,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 246 transitions. cyclomatic complexity: 86 [2022-02-21 03:26:13,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:13,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:13,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:26:13,104 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:26:13,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:26:13,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 255 transitions. [2022-02-21 03:26:13,105 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 [2022-02-21 03:26:13,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:13,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:13,106 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 165 states and 246 transitions. cyclomatic complexity: 86 [2022-02-21 03:26:13,125 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 35 examples of accepted words. [2022-02-21 03:26:13,125 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:26:13,126 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:26:13,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 21 transitions. cyclomatic complexity: 17 [2022-02-21 03:26:13,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:26:13,126 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:26:13,127 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 169 states and 255 transitions. cyclomatic complexity: 91 [2022-02-21 03:26:13,143 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 35 examples of accepted words. [2022-02-21 03:26:13,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:13,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:13,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:13,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:13,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:13,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:13,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 169 letters. Loop has 169 letters. [2022-02-21 03:26:13,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 169 letters. Loop has 169 letters. [2022-02-21 03:26:13,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 169 letters. Loop has 169 letters. [2022-02-21 03:26:13,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 165 letters. Loop has 165 letters. [2022-02-21 03:26:13,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 165 letters. Loop has 165 letters. [2022-02-21 03:26:13,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 165 letters. Loop has 165 letters. [2022-02-21 03:26:13,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:26:13,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:26:13,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:26:13,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:13,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:13,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:13,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:26:13,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:26:13,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:26:13,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:26:13,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:26:13,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:26:13,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:26:13,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:26:13,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:26:13,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 79 letters. Loop has 4 letters. [2022-02-21 03:26:13,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 79 letters. Loop has 4 letters. [2022-02-21 03:26:13,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 79 letters. Loop has 4 letters. [2022-02-21 03:26:13,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 93 letters. Loop has 12 letters. [2022-02-21 03:26:13,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 93 letters. Loop has 12 letters. [2022-02-21 03:26:13,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 93 letters. Loop has 12 letters. [2022-02-21 03:26:13,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 83 letters. Loop has 8 letters. [2022-02-21 03:26:13,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 8 letters. [2022-02-21 03:26:13,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 83 letters. Loop has 8 letters. [2022-02-21 03:26:13,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 150 letters. [2022-02-21 03:26:13,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 150 letters. [2022-02-21 03:26:13,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 150 letters. [2022-02-21 03:26:13,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 89 letters. Loop has 8 letters. [2022-02-21 03:26:13,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 89 letters. Loop has 8 letters. [2022-02-21 03:26:13,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 89 letters. Loop has 8 letters. [2022-02-21 03:26:13,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 77 letters. [2022-02-21 03:26:13,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 77 letters. [2022-02-21 03:26:13,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 77 letters. [2022-02-21 03:26:13,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 4 letters. [2022-02-21 03:26:13,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 4 letters. [2022-02-21 03:26:13,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 4 letters. [2022-02-21 03:26:13,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 84 letters. Loop has 8 letters. [2022-02-21 03:26:13,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 8 letters. [2022-02-21 03:26:13,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 84 letters. Loop has 8 letters. [2022-02-21 03:26:13,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:13,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:13,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:13,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:13,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:13,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:13,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:13,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:13,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:13,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:13,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:13,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:13,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:13,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:13,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:13,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 82 letters. Loop has 8 letters. [2022-02-21 03:26:13,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 8 letters. [2022-02-21 03:26:13,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 82 letters. Loop has 8 letters. [2022-02-21 03:26:13,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 84 letters. Loop has 77 letters. [2022-02-21 03:26:13,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 77 letters. [2022-02-21 03:26:13,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 84 letters. Loop has 77 letters. [2022-02-21 03:26:13,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 83 letters. Loop has 77 letters. [2022-02-21 03:26:13,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 77 letters. [2022-02-21 03:26:13,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 83 letters. Loop has 77 letters. [2022-02-21 03:26:13,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 82 letters. Loop has 77 letters. [2022-02-21 03:26:13,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 77 letters. [2022-02-21 03:26:13,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 82 letters. Loop has 77 letters. [2022-02-21 03:26:13,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 80 letters. Loop has 4 letters. [2022-02-21 03:26:13,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 4 letters. [2022-02-21 03:26:13,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 80 letters. Loop has 4 letters. [2022-02-21 03:26:13,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 78 letters. Loop has 4 letters. [2022-02-21 03:26:13,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 4 letters. [2022-02-21 03:26:13,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 78 letters. Loop has 4 letters. [2022-02-21 03:26:13,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 92 letters. Loop has 12 letters. [2022-02-21 03:26:13,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 92 letters. Loop has 12 letters. [2022-02-21 03:26:13,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 92 letters. Loop has 12 letters. [2022-02-21 03:26:13,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 85 letters. [2022-02-21 03:26:13,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 85 letters. [2022-02-21 03:26:13,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 85 letters. [2022-02-21 03:26:13,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 154 letters. [2022-02-21 03:26:13,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 154 letters. [2022-02-21 03:26:13,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 154 letters. [2022-02-21 03:26:13,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:13,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:13,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:13,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 219 letters. [2022-02-21 03:26:13,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 219 letters. [2022-02-21 03:26:13,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 219 letters. [2022-02-21 03:26:13,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:13,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:13,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:13,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:13,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:13,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:13,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:13,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:13,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:13,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 73 letters. [2022-02-21 03:26:13,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 73 letters. [2022-02-21 03:26:13,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 73 letters. [2022-02-21 03:26:13,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:26:13,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:26:13,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:26:13,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:26:13,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:26:13,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:26:13,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:26:13,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:26:13,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:26:13,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:13,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:13,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:13,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 89 letters. Loop has 8 letters. [2022-02-21 03:26:13,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 89 letters. Loop has 8 letters. [2022-02-21 03:26:13,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 89 letters. Loop has 8 letters. [2022-02-21 03:26:13,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 92 letters. Loop has 12 letters. [2022-02-21 03:26:13,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 92 letters. Loop has 12 letters. [2022-02-21 03:26:13,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 92 letters. Loop has 12 letters. [2022-02-21 03:26:13,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 93 letters. Loop has 12 letters. [2022-02-21 03:26:13,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 93 letters. Loop has 12 letters. [2022-02-21 03:26:13,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 93 letters. Loop has 12 letters. [2022-02-21 03:26:13,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:13,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:13,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:13,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:13,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:13,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:13,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 78 letters. Loop has 4 letters. [2022-02-21 03:26:13,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 4 letters. [2022-02-21 03:26:13,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 78 letters. Loop has 4 letters. [2022-02-21 03:26:13,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 82 letters. Loop has 146 letters. [2022-02-21 03:26:13,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 146 letters. [2022-02-21 03:26:13,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 82 letters. Loop has 146 letters. [2022-02-21 03:26:13,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 79 letters. Loop has 4 letters. [2022-02-21 03:26:13,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 79 letters. Loop has 4 letters. [2022-02-21 03:26:13,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 79 letters. Loop has 4 letters. [2022-02-21 03:26:13,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 83 letters. Loop has 146 letters. [2022-02-21 03:26:13,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 146 letters. [2022-02-21 03:26:13,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 83 letters. Loop has 146 letters. [2022-02-21 03:26:13,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 80 letters. Loop has 4 letters. [2022-02-21 03:26:13,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 4 letters. [2022-02-21 03:26:13,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 80 letters. Loop has 4 letters. [2022-02-21 03:26:13,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 84 letters. Loop has 146 letters. [2022-02-21 03:26:13,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 146 letters. [2022-02-21 03:26:13,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 84 letters. Loop has 146 letters. [2022-02-21 03:26:13,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 150 letters. [2022-02-21 03:26:13,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 150 letters. [2022-02-21 03:26:13,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 150 letters. [2022-02-21 03:26:13,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 4 letters. [2022-02-21 03:26:13,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 4 letters. [2022-02-21 03:26:13,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 4 letters. [2022-02-21 03:26:13,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 146 letters. [2022-02-21 03:26:13,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 146 letters. [2022-02-21 03:26:13,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 146 letters. [2022-02-21 03:26:13,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 82 letters. Loop has 8 letters. [2022-02-21 03:26:13,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 8 letters. [2022-02-21 03:26:13,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 82 letters. Loop has 8 letters. [2022-02-21 03:26:13,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:13,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:13,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:13,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 83 letters. Loop has 8 letters. [2022-02-21 03:26:13,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 8 letters. [2022-02-21 03:26:13,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 83 letters. Loop has 8 letters. [2022-02-21 03:26:13,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 84 letters. Loop has 8 letters. [2022-02-21 03:26:13,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 8 letters. [2022-02-21 03:26:13,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 84 letters. Loop has 8 letters. [2022-02-21 03:26:13,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:13,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:13,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:13,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:13,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:13,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:13,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:13,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:13,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:13,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:13,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 73 letters. [2022-02-21 03:26:13,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 73 letters. [2022-02-21 03:26:13,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 73 letters. [2022-02-21 03:26:13,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 154 letters. [2022-02-21 03:26:13,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 154 letters. [2022-02-21 03:26:13,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 154 letters. [2022-02-21 03:26:13,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 85 letters. [2022-02-21 03:26:13,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 85 letters. [2022-02-21 03:26:13,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 85 letters. [2022-02-21 03:26:13,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 219 letters. [2022-02-21 03:26:13,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 219 letters. [2022-02-21 03:26:13,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 219 letters. [2022-02-21 03:26:13,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 288 letters. [2022-02-21 03:26:13,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 288 letters. [2022-02-21 03:26:13,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 288 letters. [2022-02-21 03:26:13,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:13,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:13,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:13,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:13,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:13,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:13,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,230 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:26:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2022-02-21 03:26:13,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 21 transitions. Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:13,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:13,231 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:26:13,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:13,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-21 03:26:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:13,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:13,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {24457#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {24457#unseeded} is VALID [2022-02-21 03:26:13,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {24457#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {24457#unseeded} is VALID [2022-02-21 03:26:13,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {24457#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {24457#unseeded} is VALID [2022-02-21 03:26:13,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {24457#unseeded} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {24457#unseeded} is VALID [2022-02-21 03:26:13,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {24457#unseeded} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {24457#unseeded} is VALID [2022-02-21 03:26:13,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {24457#unseeded} ~m := #in~m;~n := #in~n; {24457#unseeded} is VALID [2022-02-21 03:26:13,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {24457#unseeded} assume !(0 == ~m); {24457#unseeded} is VALID [2022-02-21 03:26:13,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {24457#unseeded} assume !(0 == ~n); {24457#unseeded} is VALID [2022-02-21 03:26:13,975 INFO L272 TraceCheckUtils]: 8: Hoare triple {24457#unseeded} call #t~ret5 := ackermann(~m, ~n - 1); {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:13,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:13,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~m); {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:13,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~n; {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:13,977 INFO L272 TraceCheckUtils]: 12: Hoare triple {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := ackermann(~m - 1, 1); {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:13,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:13,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~m); {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:13,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~n); {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:13,979 INFO L272 TraceCheckUtils]: 16: Hoare triple {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := ackermann(~m, ~n - 1); {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:13,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:13,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~m); {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:13,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~n; {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:13,981 INFO L272 TraceCheckUtils]: 20: Hoare triple {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := ackermann(~m - 1, 1); {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:13,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {24895#(and (<= |ackermann_#in~n| ackermann_~n) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} is VALID [2022-02-21 03:26:13,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {24895#(and (<= |ackermann_#in~n| ackermann_~n) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} assume 0 == ~m;#res := 1 + ~n; {24899#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} is VALID [2022-02-21 03:26:13,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {24899#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} assume true; {24899#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} is VALID [2022-02-21 03:26:13,984 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {24899#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #43#return; {24906#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 2 |ackermann_#t~ret4|))} is VALID [2022-02-21 03:26:13,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {24906#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 2 |ackermann_#t~ret4|))} #res := #t~ret4;havoc #t~ret4; {24910#(and (<= 2 |ackermann_#res|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} is VALID [2022-02-21 03:26:13,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {24910#(and (<= 2 |ackermann_#res|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} assume true; {24910#(and (<= 2 |ackermann_#res|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} is VALID [2022-02-21 03:26:13,986 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {24910#(and (<= 2 |ackermann_#res|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #45#return; {24917#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 2 |ackermann_#t~ret5|))} is VALID [2022-02-21 03:26:13,987 INFO L272 TraceCheckUtils]: 28: Hoare triple {24917#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 2 |ackermann_#t~ret5|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:13,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {24895#(and (<= |ackermann_#in~n| ackermann_~n) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} is VALID [2022-02-21 03:26:13,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {24895#(and (<= |ackermann_#in~n| ackermann_~n) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} assume 0 == ~m;#res := 1 + ~n; {24899#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} is VALID [2022-02-21 03:26:13,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {24899#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} assume true; {24899#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} is VALID [2022-02-21 03:26:13,994 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {24899#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} {24917#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 2 |ackermann_#t~ret5|))} #47#return; {24933#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#t~ret6|))} is VALID [2022-02-21 03:26:13,994 INFO L290 TraceCheckUtils]: 33: Hoare triple {24933#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#t~ret6|))} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {24937#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} is VALID [2022-02-21 03:26:13,995 INFO L290 TraceCheckUtils]: 34: Hoare triple {24937#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} assume true; {24937#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} is VALID [2022-02-21 03:26:14,000 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {24937#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} {24855#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #43#return; {24944#(and (<= 3 |ackermann_#t~ret4|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} is VALID [2022-02-21 03:26:14,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {24944#(and (<= 3 |ackermann_#t~ret4|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} #res := #t~ret4;havoc #t~ret4; {24937#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} is VALID [2022-02-21 03:26:14,001 INFO L290 TraceCheckUtils]: 37: Hoare triple {24937#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} assume true; {24937#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} is VALID [2022-02-21 03:26:14,001 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {24937#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} {24457#unseeded} #45#return; {24954#(and (<= 3 |ackermann_#t~ret5|) unseeded)} is VALID [2022-02-21 03:26:14,002 INFO L272 TraceCheckUtils]: 39: Hoare triple {24954#(and (<= 3 |ackermann_#t~ret5|) unseeded)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {24481#(and (>= |ackermann_#in~n| 0) unseeded)} is VALID [2022-02-21 03:26:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:14,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:26:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:14,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:14,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {24482#(and (>= oldRank0 |ackermann_#in~n|) (>= |ackermann_#in~n| 0))} ~m := #in~m;~n := #in~n; {24958#(and (<= 0 ackermann_~n) (<= ackermann_~n oldRank0))} is VALID [2022-02-21 03:26:14,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {24958#(and (<= 0 ackermann_~n) (<= ackermann_~n oldRank0))} assume !(0 == ~m); {24958#(and (<= 0 ackermann_~n) (<= ackermann_~n oldRank0))} is VALID [2022-02-21 03:26:14,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {24958#(and (<= 0 ackermann_~n) (<= ackermann_~n oldRank0))} assume !(0 == ~n); {24965#(and (<= 0 ackermann_~n) (not (= ackermann_~n 0)) (<= ackermann_~n oldRank0))} is VALID [2022-02-21 03:26:14,067 INFO L272 TraceCheckUtils]: 3: Hoare triple {24965#(and (<= 0 ackermann_~n) (not (= ackermann_~n 0)) (<= ackermann_~n oldRank0))} call #t~ret5 := ackermann(~m, ~n - 1); {24484#(and (>= |ackermann_#in~n| 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 |ackermann_#in~n|))))} is VALID [2022-02-21 03:26:14,067 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:26:14,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:26:14,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:26:14,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:14,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,114 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 3 loop predicates [2022-02-21 03:26:14,114 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 246 transitions. cyclomatic complexity: 86 Second operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:26:14,509 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 246 transitions. cyclomatic complexity: 86. Second operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Result 169 states and 255 transitions. Complement of second has 13 states. [2022-02-21 03:26:14,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 7 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:26:14,510 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:14,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 246 transitions. cyclomatic complexity: 86 [2022-02-21 03:26:14,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:14,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:14,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:26:14,511 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:26:14,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:26:14,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 255 transitions. [2022-02-21 03:26:14,512 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 [2022-02-21 03:26:14,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:14,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:14,513 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 165 states and 246 transitions. cyclomatic complexity: 86 [2022-02-21 03:26:14,513 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 35 examples of accepted words. [2022-02-21 03:26:14,513 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:26:14,514 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:26:14,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 21 transitions. cyclomatic complexity: 17 [2022-02-21 03:26:14,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:26:14,514 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:26:14,514 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 169 states and 255 transitions. cyclomatic complexity: 91 [2022-02-21 03:26:14,526 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 35 examples of accepted words. [2022-02-21 03:26:14,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:14,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:14,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:14,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:14,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:14,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:14,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 169 letters. Loop has 169 letters. [2022-02-21 03:26:14,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 169 letters. Loop has 169 letters. [2022-02-21 03:26:14,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 169 letters. Loop has 169 letters. [2022-02-21 03:26:14,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 165 letters. Loop has 165 letters. [2022-02-21 03:26:14,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 165 letters. Loop has 165 letters. [2022-02-21 03:26:14,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 165 letters. Loop has 165 letters. [2022-02-21 03:26:14,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:26:14,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:26:14,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:26:14,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:14,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:14,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:14,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:26:14,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:26:14,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:26:14,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:26:14,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:26:14,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:26:14,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:26:14,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:26:14,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:26:14,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 79 letters. Loop has 4 letters. [2022-02-21 03:26:14,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 79 letters. Loop has 4 letters. [2022-02-21 03:26:14,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 79 letters. Loop has 4 letters. [2022-02-21 03:26:14,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 93 letters. Loop has 12 letters. [2022-02-21 03:26:14,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 93 letters. Loop has 12 letters. [2022-02-21 03:26:14,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 93 letters. Loop has 12 letters. [2022-02-21 03:26:14,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 83 letters. Loop has 8 letters. [2022-02-21 03:26:14,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 8 letters. [2022-02-21 03:26:14,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 83 letters. Loop has 8 letters. [2022-02-21 03:26:14,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 150 letters. [2022-02-21 03:26:14,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 150 letters. [2022-02-21 03:26:14,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 150 letters. [2022-02-21 03:26:14,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 89 letters. Loop has 8 letters. [2022-02-21 03:26:14,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 89 letters. Loop has 8 letters. [2022-02-21 03:26:14,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 89 letters. Loop has 8 letters. [2022-02-21 03:26:14,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 77 letters. [2022-02-21 03:26:14,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 77 letters. [2022-02-21 03:26:14,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 77 letters. [2022-02-21 03:26:14,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 4 letters. [2022-02-21 03:26:14,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 4 letters. [2022-02-21 03:26:14,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 4 letters. [2022-02-21 03:26:14,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 84 letters. Loop has 8 letters. [2022-02-21 03:26:14,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 8 letters. [2022-02-21 03:26:14,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 84 letters. Loop has 8 letters. [2022-02-21 03:26:14,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:14,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:14,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:14,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:14,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:14,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:14,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:14,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:14,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:14,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:14,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:14,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:14,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:14,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:14,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:14,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 82 letters. Loop has 8 letters. [2022-02-21 03:26:14,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 8 letters. [2022-02-21 03:26:14,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 82 letters. Loop has 8 letters. [2022-02-21 03:26:14,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 84 letters. Loop has 77 letters. [2022-02-21 03:26:14,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 77 letters. [2022-02-21 03:26:14,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 84 letters. Loop has 77 letters. [2022-02-21 03:26:14,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 83 letters. Loop has 77 letters. [2022-02-21 03:26:14,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 77 letters. [2022-02-21 03:26:14,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 83 letters. Loop has 77 letters. [2022-02-21 03:26:14,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 82 letters. Loop has 77 letters. [2022-02-21 03:26:14,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 77 letters. [2022-02-21 03:26:14,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 82 letters. Loop has 77 letters. [2022-02-21 03:26:14,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 80 letters. Loop has 4 letters. [2022-02-21 03:26:14,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 4 letters. [2022-02-21 03:26:14,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 80 letters. Loop has 4 letters. [2022-02-21 03:26:14,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 78 letters. Loop has 4 letters. [2022-02-21 03:26:14,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 4 letters. [2022-02-21 03:26:14,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 78 letters. Loop has 4 letters. [2022-02-21 03:26:14,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 92 letters. Loop has 12 letters. [2022-02-21 03:26:14,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 92 letters. Loop has 12 letters. [2022-02-21 03:26:14,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 92 letters. Loop has 12 letters. [2022-02-21 03:26:14,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 85 letters. [2022-02-21 03:26:14,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 85 letters. [2022-02-21 03:26:14,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 85 letters. [2022-02-21 03:26:14,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 154 letters. [2022-02-21 03:26:14,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 154 letters. [2022-02-21 03:26:14,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 154 letters. [2022-02-21 03:26:14,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:14,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:14,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:14,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 219 letters. [2022-02-21 03:26:14,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 219 letters. [2022-02-21 03:26:14,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 219 letters. [2022-02-21 03:26:14,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:14,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:14,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:14,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:14,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:14,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:14,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:14,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:14,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:14,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 73 letters. [2022-02-21 03:26:14,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 73 letters. [2022-02-21 03:26:14,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 73 letters. [2022-02-21 03:26:14,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:14,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:14,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:14,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:26:14,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:26:14,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:26:14,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:26:14,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:26:14,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:26:14,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:26:14,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:26:14,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:26:14,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:14,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:14,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:14,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:14,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:14,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:14,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 82 letters. Loop has 77 letters. [2022-02-21 03:26:14,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 77 letters. [2022-02-21 03:26:14,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 82 letters. Loop has 77 letters. [2022-02-21 03:26:14,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 78 letters. Loop has 4 letters. [2022-02-21 03:26:14,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 4 letters. [2022-02-21 03:26:14,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 78 letters. Loop has 4 letters. [2022-02-21 03:26:14,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 83 letters. Loop has 77 letters. [2022-02-21 03:26:14,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 77 letters. [2022-02-21 03:26:14,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 83 letters. Loop has 77 letters. [2022-02-21 03:26:14,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 79 letters. Loop has 4 letters. [2022-02-21 03:26:14,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 79 letters. Loop has 4 letters. [2022-02-21 03:26:14,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 79 letters. Loop has 4 letters. [2022-02-21 03:26:14,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 84 letters. Loop has 77 letters. [2022-02-21 03:26:14,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 77 letters. [2022-02-21 03:26:14,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 84 letters. Loop has 77 letters. [2022-02-21 03:26:14,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 80 letters. Loop has 4 letters. [2022-02-21 03:26:14,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 4 letters. [2022-02-21 03:26:14,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 80 letters. Loop has 4 letters. [2022-02-21 03:26:14,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 77 letters. [2022-02-21 03:26:14,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 77 letters. [2022-02-21 03:26:14,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 77 letters. [2022-02-21 03:26:14,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:14,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:14,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:14,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 81 letters. [2022-02-21 03:26:14,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 81 letters. [2022-02-21 03:26:14,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 81 letters. [2022-02-21 03:26:14,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 4 letters. [2022-02-21 03:26:14,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 4 letters. [2022-02-21 03:26:14,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 4 letters. [2022-02-21 03:26:14,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 86 letters. Loop has 8 letters. [2022-02-21 03:26:14,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 86 letters. Loop has 8 letters. [2022-02-21 03:26:14,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 86 letters. Loop has 8 letters. [2022-02-21 03:26:14,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:14,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:14,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:14,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 87 letters. Loop has 8 letters. [2022-02-21 03:26:14,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 87 letters. Loop has 8 letters. [2022-02-21 03:26:14,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 87 letters. Loop has 8 letters. [2022-02-21 03:26:14,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:14,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:14,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:14,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 92 letters. Loop has 8 letters. [2022-02-21 03:26:14,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 92 letters. Loop has 8 letters. [2022-02-21 03:26:14,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 92 letters. Loop has 8 letters. [2022-02-21 03:26:14,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 93 letters. Loop has 8 letters. [2022-02-21 03:26:14,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 93 letters. Loop has 8 letters. [2022-02-21 03:26:14,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 93 letters. Loop has 8 letters. [2022-02-21 03:26:14,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 96 letters. Loop has 12 letters. [2022-02-21 03:26:14,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 96 letters. Loop has 12 letters. [2022-02-21 03:26:14,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 96 letters. Loop has 12 letters. [2022-02-21 03:26:14,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 97 letters. Loop has 12 letters. [2022-02-21 03:26:14,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 97 letters. Loop has 12 letters. [2022-02-21 03:26:14,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 97 letters. Loop has 12 letters. [2022-02-21 03:26:14,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:14,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:14,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:14,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:14,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:14,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:14,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:14,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:14,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:14,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:14,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 219 letters. [2022-02-21 03:26:14,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 219 letters. [2022-02-21 03:26:14,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 85 letters. Loop has 219 letters. [2022-02-21 03:26:14,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 85 letters. [2022-02-21 03:26:14,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 85 letters. [2022-02-21 03:26:14,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 85 letters. [2022-02-21 03:26:14,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 154 letters. [2022-02-21 03:26:14,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 154 letters. [2022-02-21 03:26:14,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 154 letters. [2022-02-21 03:26:14,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 73 letters. [2022-02-21 03:26:14,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 73 letters. [2022-02-21 03:26:14,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 73 letters. [2022-02-21 03:26:14,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:14,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:14,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 169 states and 255 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:14,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,603 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:26:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2022-02-21 03:26:14,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 21 transitions. Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:14,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:14,604 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:26:14,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:14,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-21 03:26:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:14,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:15,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {24457#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {24457#unseeded} is VALID [2022-02-21 03:26:15,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {24457#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {24457#unseeded} is VALID [2022-02-21 03:26:15,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {24457#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {24457#unseeded} is VALID [2022-02-21 03:26:15,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {24457#unseeded} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {24457#unseeded} is VALID [2022-02-21 03:26:15,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {24457#unseeded} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {24457#unseeded} is VALID [2022-02-21 03:26:15,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {24457#unseeded} ~m := #in~m;~n := #in~n; {24457#unseeded} is VALID [2022-02-21 03:26:15,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {24457#unseeded} assume !(0 == ~m); {24457#unseeded} is VALID [2022-02-21 03:26:15,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {24457#unseeded} assume !(0 == ~n); {24457#unseeded} is VALID [2022-02-21 03:26:15,307 INFO L272 TraceCheckUtils]: 8: Hoare triple {24457#unseeded} call #t~ret5 := ackermann(~m, ~n - 1); {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:15,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:15,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~m); {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:15,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~n; {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:15,316 INFO L272 TraceCheckUtils]: 12: Hoare triple {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := ackermann(~m - 1, 1); {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:15,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:15,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~m); {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:15,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~n); {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:15,318 INFO L272 TraceCheckUtils]: 16: Hoare triple {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := ackermann(~m, ~n - 1); {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:15,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:15,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == ~m); {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:15,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~n; {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:15,319 INFO L272 TraceCheckUtils]: 20: Hoare triple {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := ackermann(~m - 1, 1); {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:15,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {25236#(and (<= |ackermann_#in~n| ackermann_~n) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} is VALID [2022-02-21 03:26:15,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {25236#(and (<= |ackermann_#in~n| ackermann_~n) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} assume 0 == ~m;#res := 1 + ~n; {25240#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} is VALID [2022-02-21 03:26:15,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {25240#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} assume true; {25240#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} is VALID [2022-02-21 03:26:15,322 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {25240#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #43#return; {25247#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 2 |ackermann_#t~ret4|))} is VALID [2022-02-21 03:26:15,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {25247#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 2 |ackermann_#t~ret4|))} #res := #t~ret4;havoc #t~ret4; {25251#(and (<= 2 |ackermann_#res|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} is VALID [2022-02-21 03:26:15,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {25251#(and (<= 2 |ackermann_#res|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} assume true; {25251#(and (<= 2 |ackermann_#res|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} is VALID [2022-02-21 03:26:15,323 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25251#(and (<= 2 |ackermann_#res|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #45#return; {25258#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 2 |ackermann_#t~ret5|))} is VALID [2022-02-21 03:26:15,324 INFO L272 TraceCheckUtils]: 28: Hoare triple {25258#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 2 |ackermann_#t~ret5|))} call #t~ret6 := ackermann(~m - 1, #t~ret5); {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:26:15,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~m := #in~m;~n := #in~n; {25236#(and (<= |ackermann_#in~n| ackermann_~n) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} is VALID [2022-02-21 03:26:15,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {25236#(and (<= |ackermann_#in~n| ackermann_~n) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} assume 0 == ~m;#res := 1 + ~n; {25240#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} is VALID [2022-02-21 03:26:15,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {25240#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} assume true; {25240#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} is VALID [2022-02-21 03:26:15,326 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25240#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))} {25258#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 2 |ackermann_#t~ret5|))} #47#return; {25274#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#t~ret6|))} is VALID [2022-02-21 03:26:15,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {25274#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#t~ret6|))} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {25278#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} is VALID [2022-02-21 03:26:15,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {25278#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} assume true; {25278#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} is VALID [2022-02-21 03:26:15,328 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {25278#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} {25196#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #43#return; {25285#(and (<= 3 |ackermann_#t~ret4|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} is VALID [2022-02-21 03:26:15,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {25285#(and (<= 3 |ackermann_#t~ret4|) (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))} #res := #t~ret4;havoc #t~ret4; {25278#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} is VALID [2022-02-21 03:26:15,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {25278#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} assume true; {25278#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} is VALID [2022-02-21 03:26:15,329 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {25278#(and (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 3 |ackermann_#res|))} {24457#unseeded} #45#return; {25295#(and (<= 3 |ackermann_#t~ret5|) unseeded)} is VALID [2022-02-21 03:26:15,330 INFO L272 TraceCheckUtils]: 39: Hoare triple {25295#(and (<= 3 |ackermann_#t~ret5|) unseeded)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {24481#(and (>= |ackermann_#in~n| 0) unseeded)} is VALID [2022-02-21 03:26:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:15,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:26:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:15,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:15,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {24482#(and (>= oldRank0 |ackermann_#in~n|) (>= |ackermann_#in~n| 0))} ~m := #in~m;~n := #in~n; {25299#(and (<= 0 ackermann_~n) (<= ackermann_~n oldRank0))} is VALID [2022-02-21 03:26:15,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {25299#(and (<= 0 ackermann_~n) (<= ackermann_~n oldRank0))} assume !(0 == ~m); {25299#(and (<= 0 ackermann_~n) (<= ackermann_~n oldRank0))} is VALID [2022-02-21 03:26:15,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {25299#(and (<= 0 ackermann_~n) (<= ackermann_~n oldRank0))} assume !(0 == ~n); {25306#(and (<= 0 ackermann_~n) (not (= ackermann_~n 0)) (<= ackermann_~n oldRank0))} is VALID [2022-02-21 03:26:15,387 INFO L272 TraceCheckUtils]: 3: Hoare triple {25306#(and (<= 0 ackermann_~n) (not (= ackermann_~n 0)) (<= ackermann_~n oldRank0))} call #t~ret5 := ackermann(~m, ~n - 1); {24484#(and (>= |ackermann_#in~n| 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 |ackermann_#in~n|))))} is VALID [2022-02-21 03:26:15,387 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:26:15,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:26:15,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:26:15,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:15,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:15,423 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 3 loop predicates [2022-02-21 03:26:15,423 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 246 transitions. cyclomatic complexity: 86 Second operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:26:16,252 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 246 transitions. cyclomatic complexity: 86. Second operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Result 258 states and 363 transitions. Complement of second has 42 states. [2022-02-21 03:26:16,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 12 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:26:16,252 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:16,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 246 transitions. cyclomatic complexity: 86 [2022-02-21 03:26:16,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:16,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:16,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:26:16,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:26:16,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:16,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:16,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 258 states and 363 transitions. [2022-02-21 03:26:16,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2022-02-21 03:26:16,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:16,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:16,257 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 165 states and 246 transitions. cyclomatic complexity: 86 [2022-02-21 03:26:16,257 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 35 examples of accepted words. [2022-02-21 03:26:16,257 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:26:16,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:26:16,258 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:16,258 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 258 states and 363 transitions. cyclomatic complexity: 110 [2022-02-21 03:26:16,270 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 33 examples of accepted words. [2022-02-21 03:26:16,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:16,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:16,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:16,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:26:16,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:26:16,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:26:16,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 258 letters. Loop has 258 letters. [2022-02-21 03:26:16,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 258 letters. Loop has 258 letters. [2022-02-21 03:26:16,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 258 letters. Loop has 258 letters. [2022-02-21 03:26:16,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 165 letters. Loop has 165 letters. [2022-02-21 03:26:16,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 165 letters. Loop has 165 letters. [2022-02-21 03:26:16,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 165 letters. Loop has 165 letters. [2022-02-21 03:26:16,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:26:16,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:26:16,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:26:16,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:16,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:16,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:16,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:26:16,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:26:16,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 43 letters. Loop has 4 letters. [2022-02-21 03:26:16,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:26:16,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:26:16,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:26:16,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:26:16,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:26:16,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 42 letters. Loop has 4 letters. [2022-02-21 03:26:16,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 79 letters. Loop has 4 letters. [2022-02-21 03:26:16,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 79 letters. Loop has 4 letters. [2022-02-21 03:26:16,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 79 letters. Loop has 4 letters. [2022-02-21 03:26:16,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 93 letters. Loop has 12 letters. [2022-02-21 03:26:16,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 93 letters. Loop has 12 letters. [2022-02-21 03:26:16,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 93 letters. Loop has 12 letters. [2022-02-21 03:26:16,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 83 letters. Loop has 8 letters. [2022-02-21 03:26:16,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 8 letters. [2022-02-21 03:26:16,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 83 letters. Loop has 8 letters. [2022-02-21 03:26:16,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 150 letters. [2022-02-21 03:26:16,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 150 letters. [2022-02-21 03:26:16,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 81 letters. Loop has 150 letters. [2022-02-21 03:26:16,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 89 letters. Loop has 8 letters. [2022-02-21 03:26:16,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 89 letters. Loop has 8 letters. [2022-02-21 03:26:16,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 89 letters. Loop has 8 letters. [2022-02-21 03:26:16,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 77 letters. [2022-02-21 03:26:16,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 77 letters. [2022-02-21 03:26:16,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 85 letters. Loop has 77 letters. [2022-02-21 03:26:16,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 4 letters. [2022-02-21 03:26:16,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 4 letters. [2022-02-21 03:26:16,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 81 letters. Loop has 4 letters. [2022-02-21 03:26:16,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:16,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:16,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:16,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 84 letters. Loop has 8 letters. [2022-02-21 03:26:16,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 8 letters. [2022-02-21 03:26:16,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 84 letters. Loop has 8 letters. [2022-02-21 03:26:16,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:16,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:16,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:16,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:16,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:16,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:16,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:16,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:16,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:16,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:16,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:16,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:16,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 82 letters. Loop has 8 letters. [2022-02-21 03:26:16,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 8 letters. [2022-02-21 03:26:16,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 82 letters. Loop has 8 letters. [2022-02-21 03:26:16,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 84 letters. Loop has 77 letters. [2022-02-21 03:26:16,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 77 letters. [2022-02-21 03:26:16,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 84 letters. Loop has 77 letters. [2022-02-21 03:26:16,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 83 letters. Loop has 77 letters. [2022-02-21 03:26:16,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 77 letters. [2022-02-21 03:26:16,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 83 letters. Loop has 77 letters. [2022-02-21 03:26:16,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 82 letters. Loop has 77 letters. [2022-02-21 03:26:16,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 77 letters. [2022-02-21 03:26:16,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 82 letters. Loop has 77 letters. [2022-02-21 03:26:16,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 80 letters. Loop has 4 letters. [2022-02-21 03:26:16,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 4 letters. [2022-02-21 03:26:16,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 80 letters. Loop has 4 letters. [2022-02-21 03:26:16,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 78 letters. Loop has 4 letters. [2022-02-21 03:26:16,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 4 letters. [2022-02-21 03:26:16,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 78 letters. Loop has 4 letters. [2022-02-21 03:26:16,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 92 letters. Loop has 12 letters. [2022-02-21 03:26:16,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 92 letters. Loop has 12 letters. [2022-02-21 03:26:16,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 92 letters. Loop has 12 letters. [2022-02-21 03:26:16,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 85 letters. [2022-02-21 03:26:16,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 85 letters. [2022-02-21 03:26:16,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 77 letters. Loop has 85 letters. [2022-02-21 03:26:16,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 154 letters. [2022-02-21 03:26:16,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 154 letters. [2022-02-21 03:26:16,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 77 letters. Loop has 154 letters. [2022-02-21 03:26:16,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:16,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:16,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:16,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:16,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:16,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:16,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:16,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:16,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:16,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 219 letters. [2022-02-21 03:26:16,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 219 letters. [2022-02-21 03:26:16,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 85 letters. Loop has 219 letters. [2022-02-21 03:26:16,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:16,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:16,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:16,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:16,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:16,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 77 letters. Loop has 142 letters. [2022-02-21 03:26:16,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 77 letters. Loop has 73 letters. [2022-02-21 03:26:16,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 73 letters. [2022-02-21 03:26:16,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 77 letters. Loop has 73 letters. [2022-02-21 03:26:16,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:26:16,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:26:16,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:26:16,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 87 letters. Loop has 8 letters. [2022-02-21 03:26:16,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 87 letters. Loop has 8 letters. [2022-02-21 03:26:16,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 87 letters. Loop has 8 letters. [2022-02-21 03:26:16,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 88 letters. Loop has 81 letters. [2022-02-21 03:26:16,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 88 letters. Loop has 81 letters. [2022-02-21 03:26:16,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 88 letters. Loop has 81 letters. [2022-02-21 03:26:16,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:16,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:16,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 88 letters. Loop has 8 letters. [2022-02-21 03:26:16,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 89 letters. Loop has 81 letters. [2022-02-21 03:26:16,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 89 letters. Loop has 81 letters. [2022-02-21 03:26:16,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 89 letters. Loop has 81 letters. [2022-02-21 03:26:16,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:16,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:16,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:16,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 82 letters. Loop has 73 letters. [2022-02-21 03:26:16,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 73 letters. [2022-02-21 03:26:16,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 82 letters. Loop has 73 letters. [2022-02-21 03:26:16,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 82 letters. Loop has 77 letters. [2022-02-21 03:26:16,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 77 letters. [2022-02-21 03:26:16,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 82 letters. Loop has 77 letters. [2022-02-21 03:26:16,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 154 letters. Loop has 73 letters. [2022-02-21 03:26:16,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 154 letters. Loop has 73 letters. [2022-02-21 03:26:16,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 154 letters. Loop has 73 letters. [2022-02-21 03:26:16,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 92 letters. Loop has 8 letters. [2022-02-21 03:26:16,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 92 letters. Loop has 8 letters. [2022-02-21 03:26:16,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 92 letters. Loop has 8 letters. [2022-02-21 03:26:16,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 154 letters. Loop has 150 letters. [2022-02-21 03:26:16,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 154 letters. Loop has 150 letters. [2022-02-21 03:26:16,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 154 letters. Loop has 150 letters. [2022-02-21 03:26:16,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 93 letters. Loop has 8 letters. [2022-02-21 03:26:16,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 93 letters. Loop has 8 letters. [2022-02-21 03:26:16,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 93 letters. Loop has 8 letters. [2022-02-21 03:26:16,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 84 letters. Loop has 81 letters. [2022-02-21 03:26:16,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 81 letters. [2022-02-21 03:26:16,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 84 letters. Loop has 81 letters. [2022-02-21 03:26:16,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 96 letters. Loop has 12 letters. [2022-02-21 03:26:16,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 96 letters. Loop has 12 letters. [2022-02-21 03:26:16,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 96 letters. Loop has 12 letters. [2022-02-21 03:26:16,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 84 letters. Loop has 77 letters. [2022-02-21 03:26:16,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 77 letters. [2022-02-21 03:26:16,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 84 letters. Loop has 77 letters. [2022-02-21 03:26:16,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 97 letters. Loop has 12 letters. [2022-02-21 03:26:16,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 97 letters. Loop has 12 letters. [2022-02-21 03:26:16,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 97 letters. Loop has 12 letters. [2022-02-21 03:26:16,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:16,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:16,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:16,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 77 letters. [2022-02-21 03:26:16,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 77 letters. [2022-02-21 03:26:16,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 85 letters. Loop has 77 letters. [2022-02-21 03:26:16,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:16,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:16,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:16,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 86 letters. Loop has 8 letters. [2022-02-21 03:26:16,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 86 letters. Loop has 8 letters. [2022-02-21 03:26:16,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 86 letters. Loop has 8 letters. [2022-02-21 03:26:16,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 85 letters. [2022-02-21 03:26:16,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 85 letters. [2022-02-21 03:26:16,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 81 letters. Loop has 85 letters. [2022-02-21 03:26:16,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 154 letters. [2022-02-21 03:26:16,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 154 letters. [2022-02-21 03:26:16,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 81 letters. Loop has 154 letters. [2022-02-21 03:26:16,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 146 letters. [2022-02-21 03:26:16,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 146 letters. [2022-02-21 03:26:16,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 81 letters. Loop has 146 letters. [2022-02-21 03:26:16,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 154 letters. Loop has 142 letters. [2022-02-21 03:26:16,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 154 letters. Loop has 142 letters. [2022-02-21 03:26:16,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 154 letters. Loop has 142 letters. [2022-02-21 03:26:16,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 154 letters. Loop has 73 letters. [2022-02-21 03:26:16,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 154 letters. Loop has 73 letters. [2022-02-21 03:26:16,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 154 letters. Loop has 73 letters. [2022-02-21 03:26:16,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 81 letters. Loop has 77 letters. [2022-02-21 03:26:16,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:16,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:16,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 150 letters. Loop has 146 letters. [2022-02-21 03:26:16,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 154 letters. Loop has 150 letters. [2022-02-21 03:26:16,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 154 letters. Loop has 150 letters. [2022-02-21 03:26:16,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 154 letters. Loop has 150 letters. [2022-02-21 03:26:16,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 154 letters. Loop has 219 letters. [2022-02-21 03:26:16,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 154 letters. Loop has 219 letters. [2022-02-21 03:26:16,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 154 letters. Loop has 219 letters. [2022-02-21 03:26:16,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:16,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:16,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 85 letters. Loop has 81 letters. [2022-02-21 03:26:16,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 246 transitions. cyclomatic complexity: 86 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:16,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:16,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 363 transitions. cyclomatic complexity: 110 Stem has 85 letters. Loop has 150 letters. [2022-02-21 03:26:16,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,363 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:16,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:26:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 37 transitions. [2022-02-21 03:26:16,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:26:16,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 44 letters. Loop has 4 letters. [2022-02-21 03:26:16,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 40 letters. Loop has 8 letters. [2022-02-21 03:26:16,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:16,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 258 states and 363 transitions. cyclomatic complexity: 110 [2022-02-21 03:26:16,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2022-02-21 03:26:16,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 258 states to 209 states and 287 transitions. [2022-02-21 03:26:16,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2022-02-21 03:26:16,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2022-02-21 03:26:16,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 287 transitions. [2022-02-21 03:26:16,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:26:16,379 INFO L681 BuchiCegarLoop]: Abstraction has 209 states and 287 transitions. [2022-02-21 03:26:16,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 287 transitions. [2022-02-21 03:26:16,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 184. [2022-02-21 03:26:16,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:26:16,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states and 287 transitions. Second operand has 184 states, 122 states have (on average 1.0819672131147542) internal successors, (132), 124 states have internal predecessors, (132), 42 states have call successors, (48), 25 states have call predecessors, (48), 20 states have return successors, (60), 34 states have call predecessors, (60), 37 states have call successors, (60) [2022-02-21 03:26:16,384 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states and 287 transitions. Second operand has 184 states, 122 states have (on average 1.0819672131147542) internal successors, (132), 124 states have internal predecessors, (132), 42 states have call successors, (48), 25 states have call predecessors, (48), 20 states have return successors, (60), 34 states have call predecessors, (60), 37 states have call successors, (60) [2022-02-21 03:26:16,385 INFO L87 Difference]: Start difference. First operand 209 states and 287 transitions. Second operand has 184 states, 122 states have (on average 1.0819672131147542) internal successors, (132), 124 states have internal predecessors, (132), 42 states have call successors, (48), 25 states have call predecessors, (48), 20 states have return successors, (60), 34 states have call predecessors, (60), 37 states have call successors, (60) [2022-02-21 03:26:16,385 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:16,412 INFO L93 Difference]: Finished difference Result 674 states and 885 transitions. [2022-02-21 03:26:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 885 transitions. [2022-02-21 03:26:16,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:16,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:16,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 122 states have (on average 1.0819672131147542) internal successors, (132), 124 states have internal predecessors, (132), 42 states have call successors, (48), 25 states have call predecessors, (48), 20 states have return successors, (60), 34 states have call predecessors, (60), 37 states have call successors, (60) Second operand 209 states and 287 transitions. [2022-02-21 03:26:16,416 INFO L87 Difference]: Start difference. First operand has 184 states, 122 states have (on average 1.0819672131147542) internal successors, (132), 124 states have internal predecessors, (132), 42 states have call successors, (48), 25 states have call predecessors, (48), 20 states have return successors, (60), 34 states have call predecessors, (60), 37 states have call successors, (60) Second operand 209 states and 287 transitions. [2022-02-21 03:26:16,416 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:16,446 INFO L93 Difference]: Finished difference Result 690 states and 908 transitions. [2022-02-21 03:26:16,446 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 908 transitions. [2022-02-21 03:26:16,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:16,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:16,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:26:16,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:26:16,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 122 states have (on average 1.0819672131147542) internal successors, (132), 124 states have internal predecessors, (132), 42 states have call successors, (48), 25 states have call predecessors, (48), 20 states have return successors, (60), 34 states have call predecessors, (60), 37 states have call successors, (60) [2022-02-21 03:26:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 240 transitions. [2022-02-21 03:26:16,454 INFO L704 BuchiCegarLoop]: Abstraction has 184 states and 240 transitions. [2022-02-21 03:26:16,454 INFO L587 BuchiCegarLoop]: Abstraction has 184 states and 240 transitions. [2022-02-21 03:26:16,454 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2022-02-21 03:26:16,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 240 transitions. [2022-02-21 03:26:16,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2022-02-21 03:26:16,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:16,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:16,456 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [13, 11, 9, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2022-02-21 03:26:16,456 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [13, 11, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3] [2022-02-21 03:26:16,456 INFO L791 eck$LassoCheckResult]: Stem: 25638#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 25639#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 25656#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 25657#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 25658#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 25659#ackermannENTRY ~m := #in~m;~n := #in~n; 25703#L17 assume !(0 == ~m); 25701#L20 assume !(0 == ~n); 25697#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 25699#ackermannENTRY ~m := #in~m;~n := #in~n; 25702#L17 assume !(0 == ~m); 25700#L20 assume !(0 == ~n); 25696#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 25695#ackermannENTRY ~m := #in~m;~n := #in~n; 25698#L17 assume !(0 == ~m); 25752#L20 assume 0 == ~n; 25689#L21 call #t~ret4 := ackermann(~m - 1, 1);< 25740#ackermannENTRY ~m := #in~m;~n := #in~n; 25735#L17 assume !(0 == ~m); 25733#L20 assume !(0 == ~n); 25723#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 25729#ackermannENTRY ~m := #in~m;~n := #in~n; 25793#L17 assume !(0 == ~m); 25693#L20 assume 0 == ~n; 25721#L21 call #t~ret4 := ackermann(~m - 1, 1);< 25740#ackermannENTRY ~m := #in~m;~n := #in~n; 25735#L17 assume !(0 == ~m); 25733#L20 assume !(0 == ~n); 25723#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 25729#ackermannENTRY ~m := #in~m;~n := #in~n; 25793#L17 assume !(0 == ~m); 25693#L20 assume 0 == ~n; 25721#L21 call #t~ret4 := ackermann(~m - 1, 1);< 25739#ackermannENTRY ~m := #in~m;~n := #in~n; 25755#L17 assume 0 == ~m;#res := 1 + ~n; 25754#ackermannFINAL assume true; 25753#ackermannEXIT >#43#return; 25751#L21-1 #res := #t~ret4;havoc #t~ret4; 25750#ackermannFINAL assume true; 25749#ackermannEXIT >#45#return; 25747#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 25748#ackermannENTRY ~m := #in~m;~n := #in~n; 25763#L17 assume 0 == ~m;#res := 1 + ~n; 25761#ackermannFINAL assume true; 25746#ackermannEXIT >#47#return; 25744#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 25742#ackermannFINAL assume true; 25738#ackermannEXIT >#43#return; 25734#L21-1 #res := #t~ret4;havoc #t~ret4; 25732#ackermannFINAL assume true; 25722#ackermannEXIT >#45#return; 25718#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 25720#ackermannENTRY ~m := #in~m;~n := #in~n; 25717#L17 assume !(0 == ~m); 25719#L20 assume !(0 == ~n); 25652#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 25714#ackermannENTRY ~m := #in~m;~n := #in~n; 25713#L17 assume !(0 == ~m); 25712#L20 assume 0 == ~n; 25679#L21 call #t~ret4 := ackermann(~m - 1, 1);< 25680#ackermannENTRY ~m := #in~m;~n := #in~n; 25772#L17 assume 0 == ~m;#res := 1 + ~n; 25710#ackermannFINAL assume true; 25766#ackermannEXIT >#43#return; 25682#L21-1 #res := #t~ret4;havoc #t~ret4; 25648#ackermannFINAL assume true; 25655#ackermannEXIT >#45#return; 25643#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 25640#ackermannENTRY ~m := #in~m;~n := #in~n; 25644#L17 assume 0 == ~m;#res := 1 + ~n; 25816#ackermannFINAL assume true; 25800#ackermannEXIT >#47#return; 25801#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 25812#ackermannFINAL assume true; 25811#ackermannEXIT >#47#return; 25809#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 25808#ackermannFINAL assume true; 25804#ackermannEXIT >#43#return; 25802#L21-1 #res := #t~ret4;havoc #t~ret4; 25799#ackermannFINAL assume true; 25780#ackermannEXIT >#45#return; 25666#L23-1 [2022-02-21 03:26:16,456 INFO L793 eck$LassoCheckResult]: Loop: 25666#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 25661#ackermannENTRY ~m := #in~m;~n := #in~n; 25787#L17 assume !(0 == ~m); 25788#L20 assume !(0 == ~n); 25653#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 25731#ackermannENTRY ~m := #in~m;~n := #in~n; 25770#L17 assume !(0 == ~m); 25782#L20 assume !(0 == ~n); 25654#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 25731#ackermannENTRY ~m := #in~m;~n := #in~n; 25768#L17 assume !(0 == ~m); 25767#L20 assume 0 == ~n; 25674#L21 call #t~ret4 := ackermann(~m - 1, 1);< 25711#ackermannENTRY ~m := #in~m;~n := #in~n; 25709#L17 assume !(0 == ~m); 25671#L20 assume !(0 == ~n); 25676#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 25730#ackermannENTRY ~m := #in~m;~n := #in~n; 25745#L17 assume !(0 == ~m); 25743#L20 assume 0 == ~n; 25673#L21 call #t~ret4 := ackermann(~m - 1, 1);< 25711#ackermannENTRY ~m := #in~m;~n := #in~n; 25709#L17 assume !(0 == ~m); 25671#L20 assume !(0 == ~n); 25676#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 25730#ackermannENTRY ~m := #in~m;~n := #in~n; 25745#L17 assume !(0 == ~m); 25743#L20 assume 0 == ~n; 25673#L21 call #t~ret4 := ackermann(~m - 1, 1);< 25711#ackermannENTRY ~m := #in~m;~n := #in~n; 25709#L17 assume 0 == ~m;#res := 1 + ~n; 25710#ackermannFINAL assume true; 25766#ackermannEXIT >#43#return; 25765#L21-1 #res := #t~ret4;havoc #t~ret4; 25764#ackermannFINAL assume true; 25762#ackermannEXIT >#45#return; 25759#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 25760#ackermannENTRY ~m := #in~m;~n := #in~n; 25771#L17 assume 0 == ~m;#res := 1 + ~n; 25769#ackermannFINAL assume true; 25758#ackermannEXIT >#47#return; 25757#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 25741#ackermannFINAL assume true; 25736#ackermannEXIT >#43#return; 25734#L21-1 #res := #t~ret4;havoc #t~ret4; 25732#ackermannFINAL assume true; 25722#ackermannEXIT >#45#return; 25718#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 25720#ackermannENTRY ~m := #in~m;~n := #in~n; 25717#L17 assume !(0 == ~m); 25719#L20 assume !(0 == ~n); 25652#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 25714#ackermannENTRY ~m := #in~m;~n := #in~n; 25713#L17 assume !(0 == ~m); 25712#L20 assume 0 == ~n; 25679#L21 call #t~ret4 := ackermann(~m - 1, 1);< 25680#ackermannENTRY ~m := #in~m;~n := #in~n; 25772#L17 assume 0 == ~m;#res := 1 + ~n; 25710#ackermannFINAL assume true; 25766#ackermannEXIT >#43#return; 25682#L21-1 #res := #t~ret4;havoc #t~ret4; 25648#ackermannFINAL assume true; 25655#ackermannEXIT >#45#return; 25643#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 25640#ackermannENTRY ~m := #in~m;~n := #in~n; 25644#L17 assume 0 == ~m;#res := 1 + ~n; 25816#ackermannFINAL assume true; 25800#ackermannEXIT >#47#return; 25801#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 25812#ackermannFINAL assume true; 25811#ackermannEXIT >#47#return; 25809#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 25808#ackermannFINAL assume true; 25804#ackermannEXIT >#43#return; 25802#L21-1 #res := #t~ret4;havoc #t~ret4; 25799#ackermannFINAL assume true; 25780#ackermannEXIT >#45#return; 25666#L23-1 [2022-02-21 03:26:16,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:16,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1984234175, now seen corresponding path program 5 times [2022-02-21 03:26:16,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:16,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925877905] [2022-02-21 03:26:16,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:16,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:26:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:16,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:16,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:16,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:16,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:16,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:16,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28593#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:26:16,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {28593#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:16,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:16,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {28360#true} #43#return; {28591#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:16,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:16,604 INFO L272 TraceCheckUtils]: 3: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,605 INFO L290 TraceCheckUtils]: 4: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28593#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:26:16,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {28593#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:16,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:16,606 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {28360#true} #43#return; {28591#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:16,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {28591#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {28592#(<= 2 |ackermann_#res|)} assume true; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,608 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28592#(<= 2 |ackermann_#res|)} {28360#true} #45#return; {28581#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:16,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:26:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:16,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:16,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:16,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {28581#(<= 2 |ackermann_#t~ret5|)} #47#return; {28586#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:16,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:16,630 INFO L272 TraceCheckUtils]: 3: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:16,630 INFO L290 TraceCheckUtils]: 4: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:16,631 INFO L272 TraceCheckUtils]: 7: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28593#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:26:16,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {28593#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:16,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:16,633 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {28360#true} #43#return; {28591#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:16,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {28591#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {28592#(<= 2 |ackermann_#res|)} assume true; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,634 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {28592#(<= 2 |ackermann_#res|)} {28360#true} #45#return; {28581#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:16,634 INFO L272 TraceCheckUtils]: 15: Hoare triple {28581#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:16,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:16,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:16,636 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {28581#(<= 2 |ackermann_#t~ret5|)} #47#return; {28586#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:16,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {28586#(<= 3 |ackermann_#t~ret6|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {28569#(<= 3 |ackermann_#res|)} assume true; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,637 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {28569#(<= 3 |ackermann_#res|)} {28360#true} #43#return; {28568#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:16,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:16,638 INFO L272 TraceCheckUtils]: 3: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:16,639 INFO L272 TraceCheckUtils]: 7: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:16,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:16,639 INFO L272 TraceCheckUtils]: 11: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28593#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:26:16,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {28593#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:16,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:16,641 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {28360#true} #43#return; {28591#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:16,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {28591#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {28592#(<= 2 |ackermann_#res|)} assume true; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,643 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {28592#(<= 2 |ackermann_#res|)} {28360#true} #45#return; {28581#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:16,643 INFO L272 TraceCheckUtils]: 19: Hoare triple {28581#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:16,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:16,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:16,645 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {28581#(<= 2 |ackermann_#t~ret5|)} #47#return; {28586#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:16,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {28586#(<= 3 |ackermann_#t~ret6|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {28569#(<= 3 |ackermann_#res|)} assume true; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,646 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {28569#(<= 3 |ackermann_#res|)} {28360#true} #43#return; {28568#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:16,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {28568#(<= 3 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {28569#(<= 3 |ackermann_#res|)} assume true; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,648 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {28569#(<= 3 |ackermann_#res|)} {28360#true} #45#return; {28521#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:16,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-21 03:26:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:16,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:16,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:16,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {28360#true} assume 0 == ~m;#res := 1 + ~n; {28360#true} is VALID [2022-02-21 03:26:16,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {28360#true} assume true; {28360#true} is VALID [2022-02-21 03:26:16,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28360#true} {28613#(= |ackermann_#in~n| 0)} #43#return; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,685 INFO L272 TraceCheckUtils]: 3: Hoare triple {28613#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {28360#true} assume 0 == ~m;#res := 1 + ~n; {28360#true} is VALID [2022-02-21 03:26:16,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {28360#true} assume true; {28360#true} is VALID [2022-02-21 03:26:16,686 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28360#true} {28613#(= |ackermann_#in~n| 0)} #43#return; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {28613#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {28613#(= |ackermann_#in~n| 0)} assume true; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,688 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28613#(= |ackermann_#in~n| 0)} {28595#(= ackermann_~n |ackermann_#in~n|)} #45#return; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:26:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:16,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {28360#true} assume 0 == ~m;#res := 1 + ~n; {28360#true} is VALID [2022-02-21 03:26:16,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {28360#true} assume true; {28360#true} is VALID [2022-02-21 03:26:16,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28360#true} {28608#(<= |ackermann_#in~n| 1)} #47#return; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,693 INFO L272 TraceCheckUtils]: 3: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:16,693 INFO L290 TraceCheckUtils]: 4: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,694 INFO L272 TraceCheckUtils]: 7: Hoare triple {28613#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {28360#true} assume 0 == ~m;#res := 1 + ~n; {28360#true} is VALID [2022-02-21 03:26:16,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {28360#true} assume true; {28360#true} is VALID [2022-02-21 03:26:16,695 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {28360#true} {28613#(= |ackermann_#in~n| 0)} #43#return; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {28613#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {28613#(= |ackermann_#in~n| 0)} assume true; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,697 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {28613#(= |ackermann_#in~n| 0)} {28595#(= ackermann_~n |ackermann_#in~n|)} #45#return; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,697 INFO L272 TraceCheckUtils]: 15: Hoare triple {28608#(<= |ackermann_#in~n| 1)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:16,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {28360#true} assume 0 == ~m;#res := 1 + ~n; {28360#true} is VALID [2022-02-21 03:26:16,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {28360#true} assume true; {28360#true} is VALID [2022-02-21 03:26:16,698 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {28360#true} {28608#(<= |ackermann_#in~n| 1)} #47#return; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {28608#(<= |ackermann_#in~n| 1)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {28608#(<= |ackermann_#in~n| 1)} assume true; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,699 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {28608#(<= |ackermann_#in~n| 1)} {28521#(<= 3 |ackermann_#t~ret5|)} #47#return; {28361#false} is VALID [2022-02-21 03:26:16,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:16,700 INFO L272 TraceCheckUtils]: 3: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:16,700 INFO L290 TraceCheckUtils]: 4: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:16,701 INFO L272 TraceCheckUtils]: 7: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:16,701 INFO L272 TraceCheckUtils]: 11: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:16,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:16,702 INFO L272 TraceCheckUtils]: 15: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28593#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:26:16,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {28593#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:16,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:16,704 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {28360#true} #43#return; {28591#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:16,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {28591#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {28592#(<= 2 |ackermann_#res|)} assume true; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,705 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {28592#(<= 2 |ackermann_#res|)} {28360#true} #45#return; {28581#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:16,705 INFO L272 TraceCheckUtils]: 23: Hoare triple {28581#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:16,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:16,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:16,707 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {28581#(<= 2 |ackermann_#t~ret5|)} #47#return; {28586#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:16,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {28586#(<= 3 |ackermann_#t~ret6|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {28569#(<= 3 |ackermann_#res|)} assume true; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,709 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {28569#(<= 3 |ackermann_#res|)} {28360#true} #43#return; {28568#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:16,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {28568#(<= 3 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {28569#(<= 3 |ackermann_#res|)} assume true; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,710 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {28569#(<= 3 |ackermann_#res|)} {28360#true} #45#return; {28521#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:16,710 INFO L272 TraceCheckUtils]: 34: Hoare triple {28521#(<= 3 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:16,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,711 INFO L272 TraceCheckUtils]: 38: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:16,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,713 INFO L272 TraceCheckUtils]: 42: Hoare triple {28613#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {28360#true} assume 0 == ~m;#res := 1 + ~n; {28360#true} is VALID [2022-02-21 03:26:16,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {28360#true} assume true; {28360#true} is VALID [2022-02-21 03:26:16,714 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {28360#true} {28613#(= |ackermann_#in~n| 0)} #43#return; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {28613#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {28613#(= |ackermann_#in~n| 0)} assume true; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,715 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {28613#(= |ackermann_#in~n| 0)} {28595#(= ackermann_~n |ackermann_#in~n|)} #45#return; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,715 INFO L272 TraceCheckUtils]: 50: Hoare triple {28608#(<= |ackermann_#in~n| 1)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:16,716 INFO L290 TraceCheckUtils]: 51: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,716 INFO L290 TraceCheckUtils]: 52: Hoare triple {28360#true} assume 0 == ~m;#res := 1 + ~n; {28360#true} is VALID [2022-02-21 03:26:16,716 INFO L290 TraceCheckUtils]: 53: Hoare triple {28360#true} assume true; {28360#true} is VALID [2022-02-21 03:26:16,716 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {28360#true} {28608#(<= |ackermann_#in~n| 1)} #47#return; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,717 INFO L290 TraceCheckUtils]: 55: Hoare triple {28608#(<= |ackermann_#in~n| 1)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,717 INFO L290 TraceCheckUtils]: 56: Hoare triple {28608#(<= |ackermann_#in~n| 1)} assume true; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,718 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {28608#(<= |ackermann_#in~n| 1)} {28521#(<= 3 |ackermann_#t~ret5|)} #47#return; {28361#false} is VALID [2022-02-21 03:26:16,718 INFO L290 TraceCheckUtils]: 58: Hoare triple {28361#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28361#false} is VALID [2022-02-21 03:26:16,718 INFO L290 TraceCheckUtils]: 59: Hoare triple {28361#false} assume true; {28361#false} is VALID [2022-02-21 03:26:16,718 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {28361#false} {28360#true} #43#return; {28361#false} is VALID [2022-02-21 03:26:16,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:16,719 INFO L272 TraceCheckUtils]: 3: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:16,720 INFO L272 TraceCheckUtils]: 7: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:16,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:16,720 INFO L272 TraceCheckUtils]: 11: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:16,721 INFO L272 TraceCheckUtils]: 15: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:16,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:16,721 INFO L272 TraceCheckUtils]: 19: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28593#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:26:16,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {28593#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:16,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:16,723 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {28360#true} #43#return; {28591#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:16,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {28591#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {28592#(<= 2 |ackermann_#res|)} assume true; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,725 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {28592#(<= 2 |ackermann_#res|)} {28360#true} #45#return; {28581#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:16,725 INFO L272 TraceCheckUtils]: 27: Hoare triple {28581#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:16,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:16,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:16,727 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {28581#(<= 2 |ackermann_#t~ret5|)} #47#return; {28586#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:16,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {28586#(<= 3 |ackermann_#t~ret6|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,727 INFO L290 TraceCheckUtils]: 33: Hoare triple {28569#(<= 3 |ackermann_#res|)} assume true; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,728 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {28569#(<= 3 |ackermann_#res|)} {28360#true} #43#return; {28568#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:16,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {28568#(<= 3 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {28569#(<= 3 |ackermann_#res|)} assume true; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,730 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {28569#(<= 3 |ackermann_#res|)} {28360#true} #45#return; {28521#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:16,730 INFO L272 TraceCheckUtils]: 38: Hoare triple {28521#(<= 3 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:16,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,731 INFO L272 TraceCheckUtils]: 42: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:16,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,732 INFO L272 TraceCheckUtils]: 46: Hoare triple {28613#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {28360#true} assume 0 == ~m;#res := 1 + ~n; {28360#true} is VALID [2022-02-21 03:26:16,732 INFO L290 TraceCheckUtils]: 49: Hoare triple {28360#true} assume true; {28360#true} is VALID [2022-02-21 03:26:16,733 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {28360#true} {28613#(= |ackermann_#in~n| 0)} #43#return; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,733 INFO L290 TraceCheckUtils]: 51: Hoare triple {28613#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {28613#(= |ackermann_#in~n| 0)} assume true; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,734 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {28613#(= |ackermann_#in~n| 0)} {28595#(= ackermann_~n |ackermann_#in~n|)} #45#return; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,734 INFO L272 TraceCheckUtils]: 54: Hoare triple {28608#(<= |ackermann_#in~n| 1)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:16,735 INFO L290 TraceCheckUtils]: 55: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,735 INFO L290 TraceCheckUtils]: 56: Hoare triple {28360#true} assume 0 == ~m;#res := 1 + ~n; {28360#true} is VALID [2022-02-21 03:26:16,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {28360#true} assume true; {28360#true} is VALID [2022-02-21 03:26:16,736 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {28360#true} {28608#(<= |ackermann_#in~n| 1)} #47#return; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,736 INFO L290 TraceCheckUtils]: 59: Hoare triple {28608#(<= |ackermann_#in~n| 1)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {28608#(<= |ackermann_#in~n| 1)} assume true; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,737 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {28608#(<= |ackermann_#in~n| 1)} {28521#(<= 3 |ackermann_#t~ret5|)} #47#return; {28361#false} is VALID [2022-02-21 03:26:16,737 INFO L290 TraceCheckUtils]: 62: Hoare triple {28361#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28361#false} is VALID [2022-02-21 03:26:16,737 INFO L290 TraceCheckUtils]: 63: Hoare triple {28361#false} assume true; {28361#false} is VALID [2022-02-21 03:26:16,737 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {28361#false} {28360#true} #43#return; {28361#false} is VALID [2022-02-21 03:26:16,738 INFO L290 TraceCheckUtils]: 65: Hoare triple {28361#false} #res := #t~ret4;havoc #t~ret4; {28361#false} is VALID [2022-02-21 03:26:16,738 INFO L290 TraceCheckUtils]: 66: Hoare triple {28361#false} assume true; {28361#false} is VALID [2022-02-21 03:26:16,738 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {28361#false} {28360#true} #45#return; {28361#false} is VALID [2022-02-21 03:26:16,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {28360#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {28360#true} is VALID [2022-02-21 03:26:16,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {28360#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {28360#true} is VALID [2022-02-21 03:26:16,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {28360#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {28360#true} is VALID [2022-02-21 03:26:16,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {28360#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {28360#true} is VALID [2022-02-21 03:26:16,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {28360#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {28360#true} is VALID [2022-02-21 03:26:16,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:16,739 INFO L272 TraceCheckUtils]: 8: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:16,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:16,740 INFO L272 TraceCheckUtils]: 12: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:16,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:16,740 INFO L272 TraceCheckUtils]: 16: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:16,741 INFO L272 TraceCheckUtils]: 20: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:16,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:16,741 INFO L272 TraceCheckUtils]: 24: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:16,742 INFO L272 TraceCheckUtils]: 28: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:16,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:16,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:16,742 INFO L272 TraceCheckUtils]: 32: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28593#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:26:16,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {28593#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:16,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:16,745 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {28594#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {28360#true} #43#return; {28591#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:16,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {28591#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {28592#(<= 2 |ackermann_#res|)} assume true; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,746 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28592#(<= 2 |ackermann_#res|)} {28360#true} #45#return; {28581#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:16,746 INFO L272 TraceCheckUtils]: 40: Hoare triple {28581#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:16,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:16,747 INFO L290 TraceCheckUtils]: 43: Hoare triple {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:16,748 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {28581#(<= 2 |ackermann_#t~ret5|)} #47#return; {28586#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:16,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {28586#(<= 3 |ackermann_#t~ret6|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,749 INFO L290 TraceCheckUtils]: 46: Hoare triple {28569#(<= 3 |ackermann_#res|)} assume true; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,749 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28569#(<= 3 |ackermann_#res|)} {28360#true} #43#return; {28568#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:16,750 INFO L290 TraceCheckUtils]: 48: Hoare triple {28568#(<= 3 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,750 INFO L290 TraceCheckUtils]: 49: Hoare triple {28569#(<= 3 |ackermann_#res|)} assume true; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:16,751 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {28569#(<= 3 |ackermann_#res|)} {28360#true} #45#return; {28521#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:16,751 INFO L272 TraceCheckUtils]: 51: Hoare triple {28521#(<= 3 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:16,751 INFO L290 TraceCheckUtils]: 52: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,752 INFO L290 TraceCheckUtils]: 53: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,752 INFO L290 TraceCheckUtils]: 54: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,752 INFO L272 TraceCheckUtils]: 55: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:16,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,753 INFO L290 TraceCheckUtils]: 57: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {28595#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:16,753 INFO L290 TraceCheckUtils]: 58: Hoare triple {28595#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,753 INFO L272 TraceCheckUtils]: 59: Hoare triple {28613#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:16,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {28360#true} assume 0 == ~m;#res := 1 + ~n; {28360#true} is VALID [2022-02-21 03:26:16,754 INFO L290 TraceCheckUtils]: 62: Hoare triple {28360#true} assume true; {28360#true} is VALID [2022-02-21 03:26:16,754 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28360#true} {28613#(= |ackermann_#in~n| 0)} #43#return; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,754 INFO L290 TraceCheckUtils]: 64: Hoare triple {28613#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,755 INFO L290 TraceCheckUtils]: 65: Hoare triple {28613#(= |ackermann_#in~n| 0)} assume true; {28613#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:16,756 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {28613#(= |ackermann_#in~n| 0)} {28595#(= ackermann_~n |ackermann_#in~n|)} #45#return; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,756 INFO L272 TraceCheckUtils]: 67: Hoare triple {28608#(<= |ackermann_#in~n| 1)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:16,756 INFO L290 TraceCheckUtils]: 68: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:16,756 INFO L290 TraceCheckUtils]: 69: Hoare triple {28360#true} assume 0 == ~m;#res := 1 + ~n; {28360#true} is VALID [2022-02-21 03:26:16,756 INFO L290 TraceCheckUtils]: 70: Hoare triple {28360#true} assume true; {28360#true} is VALID [2022-02-21 03:26:16,757 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28360#true} {28608#(<= |ackermann_#in~n| 1)} #47#return; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,757 INFO L290 TraceCheckUtils]: 72: Hoare triple {28608#(<= |ackermann_#in~n| 1)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,757 INFO L290 TraceCheckUtils]: 73: Hoare triple {28608#(<= |ackermann_#in~n| 1)} assume true; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:16,758 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {28608#(<= |ackermann_#in~n| 1)} {28521#(<= 3 |ackermann_#t~ret5|)} #47#return; {28361#false} is VALID [2022-02-21 03:26:16,758 INFO L290 TraceCheckUtils]: 75: Hoare triple {28361#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28361#false} is VALID [2022-02-21 03:26:16,758 INFO L290 TraceCheckUtils]: 76: Hoare triple {28361#false} assume true; {28361#false} is VALID [2022-02-21 03:26:16,758 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {28361#false} {28360#true} #43#return; {28361#false} is VALID [2022-02-21 03:26:16,759 INFO L290 TraceCheckUtils]: 78: Hoare triple {28361#false} #res := #t~ret4;havoc #t~ret4; {28361#false} is VALID [2022-02-21 03:26:16,759 INFO L290 TraceCheckUtils]: 79: Hoare triple {28361#false} assume true; {28361#false} is VALID [2022-02-21 03:26:16,759 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {28361#false} {28360#true} #45#return; {28361#false} is VALID [2022-02-21 03:26:16,759 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 115 proven. 61 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-02-21 03:26:16,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:26:16,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925877905] [2022-02-21 03:26:16,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925877905] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:26:16,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329337675] [2022-02-21 03:26:16,760 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:26:16,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:26:16,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:16,762 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:26:16,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2022-02-21 03:26:16,843 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-02-21 03:26:16,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:26:16,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-21 03:26:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:16,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:17,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {28360#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {28360#true} is VALID [2022-02-21 03:26:17,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {28360#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {28360#true} is VALID [2022-02-21 03:26:17,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {28360#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {28360#true} is VALID [2022-02-21 03:26:17,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {28360#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {28360#true} is VALID [2022-02-21 03:26:17,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {28360#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {28360#true} is VALID [2022-02-21 03:26:17,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:17,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:17,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:17,176 INFO L272 TraceCheckUtils]: 8: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:17,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:17,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:17,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:17,177 INFO L272 TraceCheckUtils]: 12: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:17,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:17,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:17,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:17,177 INFO L272 TraceCheckUtils]: 16: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:17,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:17,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:17,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:17,177 INFO L272 TraceCheckUtils]: 20: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:17,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:17,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:17,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:17,177 INFO L272 TraceCheckUtils]: 24: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:17,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:17,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:17,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:17,178 INFO L272 TraceCheckUtils]: 28: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:17,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:17,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:17,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:17,178 INFO L272 TraceCheckUtils]: 32: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:17,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28720#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:17,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {28720#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:17,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:17,180 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {28360#true} #43#return; {28591#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:17,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {28591#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:17,180 INFO L290 TraceCheckUtils]: 38: Hoare triple {28592#(<= 2 |ackermann_#res|)} assume true; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:17,181 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28592#(<= 2 |ackermann_#res|)} {28360#true} #45#return; {28581#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:17,181 INFO L272 TraceCheckUtils]: 40: Hoare triple {28581#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:17,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28720#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:17,182 INFO L290 TraceCheckUtils]: 42: Hoare triple {28720#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:17,182 INFO L290 TraceCheckUtils]: 43: Hoare triple {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:17,183 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {28596#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {28581#(<= 2 |ackermann_#t~ret5|)} #47#return; {28586#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:17,183 INFO L290 TraceCheckUtils]: 45: Hoare triple {28586#(<= 3 |ackermann_#t~ret6|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:17,183 INFO L290 TraceCheckUtils]: 46: Hoare triple {28569#(<= 3 |ackermann_#res|)} assume true; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:17,184 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28569#(<= 3 |ackermann_#res|)} {28360#true} #43#return; {28568#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:17,184 INFO L290 TraceCheckUtils]: 48: Hoare triple {28568#(<= 3 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:17,185 INFO L290 TraceCheckUtils]: 49: Hoare triple {28569#(<= 3 |ackermann_#res|)} assume true; {28569#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:17,185 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {28569#(<= 3 |ackermann_#res|)} {28360#true} #45#return; {28521#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:17,185 INFO L272 TraceCheckUtils]: 51: Hoare triple {28521#(<= 3 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:17,186 INFO L290 TraceCheckUtils]: 52: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28720#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:17,186 INFO L290 TraceCheckUtils]: 53: Hoare triple {28720#(<= |ackermann_#in~n| ackermann_~n)} assume !(0 == ~m); {28720#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:17,186 INFO L290 TraceCheckUtils]: 54: Hoare triple {28720#(<= |ackermann_#in~n| ackermann_~n)} assume !(0 == ~n); {28720#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:17,186 INFO L272 TraceCheckUtils]: 55: Hoare triple {28720#(<= |ackermann_#in~n| ackermann_~n)} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:17,186 INFO L290 TraceCheckUtils]: 56: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28720#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:17,187 INFO L290 TraceCheckUtils]: 57: Hoare triple {28720#(<= |ackermann_#in~n| ackermann_~n)} assume !(0 == ~m); {28720#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:17,187 INFO L290 TraceCheckUtils]: 58: Hoare triple {28720#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~n; {28796#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:17,187 INFO L272 TraceCheckUtils]: 59: Hoare triple {28796#(<= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:17,187 INFO L290 TraceCheckUtils]: 60: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:17,187 INFO L290 TraceCheckUtils]: 61: Hoare triple {28360#true} assume 0 == ~m;#res := 1 + ~n; {28360#true} is VALID [2022-02-21 03:26:17,187 INFO L290 TraceCheckUtils]: 62: Hoare triple {28360#true} assume true; {28360#true} is VALID [2022-02-21 03:26:17,188 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28360#true} {28796#(<= |ackermann_#in~n| 0)} #43#return; {28796#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:17,188 INFO L290 TraceCheckUtils]: 64: Hoare triple {28796#(<= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {28796#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:17,188 INFO L290 TraceCheckUtils]: 65: Hoare triple {28796#(<= |ackermann_#in~n| 0)} assume true; {28796#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:17,189 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {28796#(<= |ackermann_#in~n| 0)} {28720#(<= |ackermann_#in~n| ackermann_~n)} #45#return; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:17,189 INFO L272 TraceCheckUtils]: 67: Hoare triple {28608#(<= |ackermann_#in~n| 1)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:17,189 INFO L290 TraceCheckUtils]: 68: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:17,189 INFO L290 TraceCheckUtils]: 69: Hoare triple {28360#true} assume 0 == ~m;#res := 1 + ~n; {28360#true} is VALID [2022-02-21 03:26:17,189 INFO L290 TraceCheckUtils]: 70: Hoare triple {28360#true} assume true; {28360#true} is VALID [2022-02-21 03:26:17,190 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28360#true} {28608#(<= |ackermann_#in~n| 1)} #47#return; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:17,190 INFO L290 TraceCheckUtils]: 72: Hoare triple {28608#(<= |ackermann_#in~n| 1)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:17,191 INFO L290 TraceCheckUtils]: 73: Hoare triple {28608#(<= |ackermann_#in~n| 1)} assume true; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:17,191 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {28608#(<= |ackermann_#in~n| 1)} {28521#(<= 3 |ackermann_#t~ret5|)} #47#return; {28361#false} is VALID [2022-02-21 03:26:17,191 INFO L290 TraceCheckUtils]: 75: Hoare triple {28361#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28361#false} is VALID [2022-02-21 03:26:17,191 INFO L290 TraceCheckUtils]: 76: Hoare triple {28361#false} assume true; {28361#false} is VALID [2022-02-21 03:26:17,191 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {28361#false} {28360#true} #43#return; {28361#false} is VALID [2022-02-21 03:26:17,191 INFO L290 TraceCheckUtils]: 78: Hoare triple {28361#false} #res := #t~ret4;havoc #t~ret4; {28361#false} is VALID [2022-02-21 03:26:17,192 INFO L290 TraceCheckUtils]: 79: Hoare triple {28361#false} assume true; {28361#false} is VALID [2022-02-21 03:26:17,192 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {28361#false} {28360#true} #45#return; {28361#false} is VALID [2022-02-21 03:26:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 102 proven. 69 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-02-21 03:26:17,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:26:21,663 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {28361#false} {28360#true} #45#return; {28361#false} is VALID [2022-02-21 03:26:21,663 INFO L290 TraceCheckUtils]: 79: Hoare triple {28361#false} assume true; {28361#false} is VALID [2022-02-21 03:26:21,663 INFO L290 TraceCheckUtils]: 78: Hoare triple {28361#false} #res := #t~ret4;havoc #t~ret4; {28361#false} is VALID [2022-02-21 03:26:21,663 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {28361#false} {28360#true} #43#return; {28361#false} is VALID [2022-02-21 03:26:21,663 INFO L290 TraceCheckUtils]: 76: Hoare triple {28361#false} assume true; {28361#false} is VALID [2022-02-21 03:26:21,663 INFO L290 TraceCheckUtils]: 75: Hoare triple {28361#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28361#false} is VALID [2022-02-21 03:26:21,664 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {28608#(<= |ackermann_#in~n| 1)} {28581#(<= 2 |ackermann_#t~ret5|)} #47#return; {28361#false} is VALID [2022-02-21 03:26:21,664 INFO L290 TraceCheckUtils]: 73: Hoare triple {28608#(<= |ackermann_#in~n| 1)} assume true; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,665 INFO L290 TraceCheckUtils]: 72: Hoare triple {28608#(<= |ackermann_#in~n| 1)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,665 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28360#true} {28608#(<= |ackermann_#in~n| 1)} #47#return; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,665 INFO L290 TraceCheckUtils]: 70: Hoare triple {28360#true} assume true; {28360#true} is VALID [2022-02-21 03:26:21,665 INFO L290 TraceCheckUtils]: 69: Hoare triple {28360#true} assume 0 == ~m;#res := 1 + ~n; {28360#true} is VALID [2022-02-21 03:26:21,665 INFO L290 TraceCheckUtils]: 68: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:21,665 INFO L272 TraceCheckUtils]: 67: Hoare triple {28608#(<= |ackermann_#in~n| 1)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:21,666 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {28796#(<= |ackermann_#in~n| 0)} {28914#(or (< 1 ackermann_~n) (<= |ackermann_#in~n| 1))} #45#return; {28608#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,666 INFO L290 TraceCheckUtils]: 65: Hoare triple {28796#(<= |ackermann_#in~n| 0)} assume true; {28796#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,667 INFO L290 TraceCheckUtils]: 64: Hoare triple {28796#(<= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {28796#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,667 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28360#true} {28796#(<= |ackermann_#in~n| 0)} #43#return; {28796#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,667 INFO L290 TraceCheckUtils]: 62: Hoare triple {28360#true} assume true; {28360#true} is VALID [2022-02-21 03:26:21,667 INFO L290 TraceCheckUtils]: 61: Hoare triple {28360#true} assume 0 == ~m;#res := 1 + ~n; {28360#true} is VALID [2022-02-21 03:26:21,667 INFO L290 TraceCheckUtils]: 60: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:21,667 INFO L272 TraceCheckUtils]: 59: Hoare triple {28796#(<= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:21,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {28942#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} assume 0 == ~n; {28796#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,668 INFO L290 TraceCheckUtils]: 57: Hoare triple {28942#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} assume !(0 == ~m); {28942#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} is VALID [2022-02-21 03:26:21,668 INFO L290 TraceCheckUtils]: 56: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28942#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} is VALID [2022-02-21 03:26:21,668 INFO L272 TraceCheckUtils]: 55: Hoare triple {28914#(or (< 1 ackermann_~n) (<= |ackermann_#in~n| 1))} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:21,669 INFO L290 TraceCheckUtils]: 54: Hoare triple {28914#(or (< 1 ackermann_~n) (<= |ackermann_#in~n| 1))} assume !(0 == ~n); {28914#(or (< 1 ackermann_~n) (<= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:26:21,669 INFO L290 TraceCheckUtils]: 53: Hoare triple {28914#(or (< 1 ackermann_~n) (<= |ackermann_#in~n| 1))} assume !(0 == ~m); {28914#(or (< 1 ackermann_~n) (<= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:26:21,669 INFO L290 TraceCheckUtils]: 52: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28914#(or (< 1 ackermann_~n) (<= |ackermann_#in~n| 1))} is VALID [2022-02-21 03:26:21,670 INFO L272 TraceCheckUtils]: 51: Hoare triple {28581#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:21,670 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {28592#(<= 2 |ackermann_#res|)} {28360#true} #45#return; {28581#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:21,670 INFO L290 TraceCheckUtils]: 49: Hoare triple {28592#(<= 2 |ackermann_#res|)} assume true; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,671 INFO L290 TraceCheckUtils]: 48: Hoare triple {28591#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,671 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28592#(<= 2 |ackermann_#res|)} {28360#true} #43#return; {28591#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:21,672 INFO L290 TraceCheckUtils]: 46: Hoare triple {28592#(<= 2 |ackermann_#res|)} assume true; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,672 INFO L290 TraceCheckUtils]: 45: Hoare triple {28982#(<= 2 |ackermann_#t~ret6|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {28592#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,672 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {28990#(or (< |ackermann_#in~n| 1) (<= 2 |ackermann_#res|))} {28986#(<= 1 |ackermann_#t~ret5|)} #47#return; {28982#(<= 2 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:21,673 INFO L290 TraceCheckUtils]: 43: Hoare triple {28990#(or (< |ackermann_#in~n| 1) (<= 2 |ackermann_#res|))} assume true; {28990#(or (< |ackermann_#in~n| 1) (<= 2 |ackermann_#res|))} is VALID [2022-02-21 03:26:21,673 INFO L290 TraceCheckUtils]: 42: Hoare triple {28942#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} assume 0 == ~m;#res := 1 + ~n; {28990#(or (< |ackermann_#in~n| 1) (<= 2 |ackermann_#res|))} is VALID [2022-02-21 03:26:21,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28942#(or (not (<= ackermann_~n 0)) (<= |ackermann_#in~n| 0))} is VALID [2022-02-21 03:26:21,674 INFO L272 TraceCheckUtils]: 40: Hoare triple {28986#(<= 1 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {28360#true} is VALID [2022-02-21 03:26:21,674 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {29006#(<= 1 |ackermann_#res|)} {28360#true} #45#return; {28986#(<= 1 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:21,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {29006#(<= 1 |ackermann_#res|)} assume true; {29006#(<= 1 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {29013#(<= 1 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {29006#(<= 1 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,675 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29020#(or (not (<= 1 |ackermann_#in~n|)) (<= 1 |ackermann_#res|))} {28360#true} #43#return; {29013#(<= 1 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:21,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {29020#(or (not (<= 1 |ackermann_#in~n|)) (<= 1 |ackermann_#res|))} assume true; {29020#(or (not (<= 1 |ackermann_#in~n|)) (<= 1 |ackermann_#res|))} is VALID [2022-02-21 03:26:21,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {29027#(or (<= 0 ackermann_~n) (not (<= 1 |ackermann_#in~n|)))} assume 0 == ~m;#res := 1 + ~n; {29020#(or (not (<= 1 |ackermann_#in~n|)) (<= 1 |ackermann_#res|))} is VALID [2022-02-21 03:26:21,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {29027#(or (<= 0 ackermann_~n) (not (<= 1 |ackermann_#in~n|)))} is VALID [2022-02-21 03:26:21,676 INFO L272 TraceCheckUtils]: 32: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:21,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:21,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:21,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:21,677 INFO L272 TraceCheckUtils]: 28: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:21,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:21,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:21,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:21,677 INFO L272 TraceCheckUtils]: 24: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:21,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:21,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:21,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:21,677 INFO L272 TraceCheckUtils]: 20: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:21,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:21,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:21,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:21,678 INFO L272 TraceCheckUtils]: 16: Hoare triple {28360#true} call #t~ret4 := ackermann(~m - 1, 1); {28360#true} is VALID [2022-02-21 03:26:21,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {28360#true} assume 0 == ~n; {28360#true} is VALID [2022-02-21 03:26:21,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:21,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:21,678 INFO L272 TraceCheckUtils]: 12: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:21,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:21,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:21,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:21,678 INFO L272 TraceCheckUtils]: 8: Hoare triple {28360#true} call #t~ret5 := ackermann(~m, ~n - 1); {28360#true} is VALID [2022-02-21 03:26:21,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {28360#true} assume !(0 == ~n); {28360#true} is VALID [2022-02-21 03:26:21,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {28360#true} assume !(0 == ~m); {28360#true} is VALID [2022-02-21 03:26:21,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {28360#true} ~m := #in~m;~n := #in~n; {28360#true} is VALID [2022-02-21 03:26:21,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {28360#true} call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1); {28360#true} is VALID [2022-02-21 03:26:21,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {28360#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); {28360#true} is VALID [2022-02-21 03:26:21,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {28360#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {28360#true} is VALID [2022-02-21 03:26:21,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {28360#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {28360#true} is VALID [2022-02-21 03:26:21,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {28360#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {28360#true} is VALID [2022-02-21 03:26:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 59 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-02-21 03:26:21,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329337675] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:26:21,679 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:26:21,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 16] total 26 [2022-02-21 03:26:21,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136501717] [2022-02-21 03:26:21,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:26:21,680 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:26:21,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1263997516, now seen corresponding path program 3 times [2022-02-21 03:26:21,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:21,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548765216] [2022-02-21 03:26:21,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:21,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:21,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:26:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:21,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:21,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:21,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:21,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:21,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:21,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29342#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:26:21,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {29342#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:21,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:21,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {29109#true} #43#return; {29340#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:21,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {29109#true} assume 0 == ~n; {29109#true} is VALID [2022-02-21 03:26:21,825 INFO L272 TraceCheckUtils]: 3: Hoare triple {29109#true} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29342#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:26:21,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {29342#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:21,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:21,827 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {29109#true} #43#return; {29340#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:21,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {29340#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {29341#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {29341#(<= 2 |ackermann_#res|)} assume true; {29341#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,828 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29341#(<= 2 |ackermann_#res|)} {29109#true} #45#return; {29330#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:21,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:26:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:21,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:21,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:21,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {29330#(<= 2 |ackermann_#t~ret5|)} #47#return; {29335#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:21,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {29109#true} assume !(0 == ~n); {29109#true} is VALID [2022-02-21 03:26:21,852 INFO L272 TraceCheckUtils]: 3: Hoare triple {29109#true} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:21,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {29109#true} assume 0 == ~n; {29109#true} is VALID [2022-02-21 03:26:21,853 INFO L272 TraceCheckUtils]: 7: Hoare triple {29109#true} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29342#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:26:21,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {29342#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:21,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:21,855 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {29109#true} #43#return; {29340#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:21,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {29340#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {29341#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {29341#(<= 2 |ackermann_#res|)} assume true; {29341#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,857 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {29341#(<= 2 |ackermann_#res|)} {29109#true} #45#return; {29330#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:21,857 INFO L272 TraceCheckUtils]: 15: Hoare triple {29330#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:21,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:21,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:21,859 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {29330#(<= 2 |ackermann_#t~ret5|)} #47#return; {29335#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:21,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {29335#(<= 3 |ackermann_#t~ret6|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {29318#(<= 3 |ackermann_#res|)} assume true; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,860 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29318#(<= 3 |ackermann_#res|)} {29109#true} #43#return; {29317#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:21,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {29109#true} assume 0 == ~n; {29109#true} is VALID [2022-02-21 03:26:21,861 INFO L272 TraceCheckUtils]: 3: Hoare triple {29109#true} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,861 INFO L290 TraceCheckUtils]: 4: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {29109#true} assume !(0 == ~n); {29109#true} is VALID [2022-02-21 03:26:21,861 INFO L272 TraceCheckUtils]: 7: Hoare triple {29109#true} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:21,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {29109#true} assume 0 == ~n; {29109#true} is VALID [2022-02-21 03:26:21,862 INFO L272 TraceCheckUtils]: 11: Hoare triple {29109#true} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29342#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:26:21,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {29342#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:21,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:21,864 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {29109#true} #43#return; {29340#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:21,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {29340#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {29341#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {29341#(<= 2 |ackermann_#res|)} assume true; {29341#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,865 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29341#(<= 2 |ackermann_#res|)} {29109#true} #45#return; {29330#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:21,866 INFO L272 TraceCheckUtils]: 19: Hoare triple {29330#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:21,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:21,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:21,868 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {29330#(<= 2 |ackermann_#t~ret5|)} #47#return; {29335#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:21,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {29335#(<= 3 |ackermann_#t~ret6|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {29318#(<= 3 |ackermann_#res|)} assume true; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,869 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29318#(<= 3 |ackermann_#res|)} {29109#true} #43#return; {29317#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:21,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {29317#(<= 3 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {29318#(<= 3 |ackermann_#res|)} assume true; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,870 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {29318#(<= 3 |ackermann_#res|)} {29109#true} #45#return; {29270#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:21,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-21 03:26:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:21,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:21,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:26:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:21,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {29109#true} assume 0 == ~m;#res := 1 + ~n; {29109#true} is VALID [2022-02-21 03:26:21,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {29109#true} assume true; {29109#true} is VALID [2022-02-21 03:26:21,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29109#true} {29362#(= |ackermann_#in~n| 0)} #43#return; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,907 INFO L272 TraceCheckUtils]: 3: Hoare triple {29362#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,907 INFO L290 TraceCheckUtils]: 4: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {29109#true} assume 0 == ~m;#res := 1 + ~n; {29109#true} is VALID [2022-02-21 03:26:21,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {29109#true} assume true; {29109#true} is VALID [2022-02-21 03:26:21,908 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29109#true} {29362#(= |ackermann_#in~n| 0)} #43#return; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {29362#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {29362#(= |ackermann_#in~n| 0)} assume true; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,909 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29362#(= |ackermann_#in~n| 0)} {29344#(= ackermann_~n |ackermann_#in~n|)} #45#return; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:26:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:21,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {29109#true} assume 0 == ~m;#res := 1 + ~n; {29109#true} is VALID [2022-02-21 03:26:21,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {29109#true} assume true; {29109#true} is VALID [2022-02-21 03:26:21,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29109#true} {29357#(<= |ackermann_#in~n| 1)} #47#return; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,915 INFO L272 TraceCheckUtils]: 3: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:21,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,916 INFO L272 TraceCheckUtils]: 7: Hoare triple {29362#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {29109#true} assume 0 == ~m;#res := 1 + ~n; {29109#true} is VALID [2022-02-21 03:26:21,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {29109#true} assume true; {29109#true} is VALID [2022-02-21 03:26:21,917 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {29109#true} {29362#(= |ackermann_#in~n| 0)} #43#return; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {29362#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {29362#(= |ackermann_#in~n| 0)} assume true; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,918 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {29362#(= |ackermann_#in~n| 0)} {29344#(= ackermann_~n |ackermann_#in~n|)} #45#return; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,919 INFO L272 TraceCheckUtils]: 15: Hoare triple {29357#(<= |ackermann_#in~n| 1)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:21,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {29109#true} assume 0 == ~m;#res := 1 + ~n; {29109#true} is VALID [2022-02-21 03:26:21,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {29109#true} assume true; {29109#true} is VALID [2022-02-21 03:26:21,920 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {29109#true} {29357#(<= |ackermann_#in~n| 1)} #47#return; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {29357#(<= |ackermann_#in~n| 1)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {29357#(<= |ackermann_#in~n| 1)} assume true; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,921 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29357#(<= |ackermann_#in~n| 1)} {29270#(<= 3 |ackermann_#t~ret5|)} #47#return; {29110#false} is VALID [2022-02-21 03:26:21,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {29109#true} assume !(0 == ~n); {29109#true} is VALID [2022-02-21 03:26:21,922 INFO L272 TraceCheckUtils]: 3: Hoare triple {29109#true} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:21,922 INFO L290 TraceCheckUtils]: 4: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {29109#true} assume 0 == ~n; {29109#true} is VALID [2022-02-21 03:26:21,922 INFO L272 TraceCheckUtils]: 7: Hoare triple {29109#true} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {29109#true} assume !(0 == ~n); {29109#true} is VALID [2022-02-21 03:26:21,923 INFO L272 TraceCheckUtils]: 11: Hoare triple {29109#true} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:21,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {29109#true} assume 0 == ~n; {29109#true} is VALID [2022-02-21 03:26:21,924 INFO L272 TraceCheckUtils]: 15: Hoare triple {29109#true} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29342#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:26:21,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {29342#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:21,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:21,926 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {29109#true} #43#return; {29340#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:21,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {29340#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {29341#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {29341#(<= 2 |ackermann_#res|)} assume true; {29341#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,927 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29341#(<= 2 |ackermann_#res|)} {29109#true} #45#return; {29330#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:21,927 INFO L272 TraceCheckUtils]: 23: Hoare triple {29330#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:21,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:21,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:21,929 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {29330#(<= 2 |ackermann_#t~ret5|)} #47#return; {29335#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:21,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {29335#(<= 3 |ackermann_#t~ret6|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {29318#(<= 3 |ackermann_#res|)} assume true; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,931 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29318#(<= 3 |ackermann_#res|)} {29109#true} #43#return; {29317#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:21,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {29317#(<= 3 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {29318#(<= 3 |ackermann_#res|)} assume true; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,932 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {29318#(<= 3 |ackermann_#res|)} {29109#true} #45#return; {29270#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:21,932 INFO L272 TraceCheckUtils]: 34: Hoare triple {29270#(<= 3 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:21,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,933 INFO L272 TraceCheckUtils]: 38: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:21,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,935 INFO L272 TraceCheckUtils]: 42: Hoare triple {29362#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,935 INFO L290 TraceCheckUtils]: 43: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {29109#true} assume 0 == ~m;#res := 1 + ~n; {29109#true} is VALID [2022-02-21 03:26:21,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {29109#true} assume true; {29109#true} is VALID [2022-02-21 03:26:21,936 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29109#true} {29362#(= |ackermann_#in~n| 0)} #43#return; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {29362#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {29362#(= |ackermann_#in~n| 0)} assume true; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,937 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {29362#(= |ackermann_#in~n| 0)} {29344#(= ackermann_~n |ackermann_#in~n|)} #45#return; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,937 INFO L272 TraceCheckUtils]: 50: Hoare triple {29357#(<= |ackermann_#in~n| 1)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:21,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,938 INFO L290 TraceCheckUtils]: 52: Hoare triple {29109#true} assume 0 == ~m;#res := 1 + ~n; {29109#true} is VALID [2022-02-21 03:26:21,938 INFO L290 TraceCheckUtils]: 53: Hoare triple {29109#true} assume true; {29109#true} is VALID [2022-02-21 03:26:21,938 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29109#true} {29357#(<= |ackermann_#in~n| 1)} #47#return; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,939 INFO L290 TraceCheckUtils]: 55: Hoare triple {29357#(<= |ackermann_#in~n| 1)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,939 INFO L290 TraceCheckUtils]: 56: Hoare triple {29357#(<= |ackermann_#in~n| 1)} assume true; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,940 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {29357#(<= |ackermann_#in~n| 1)} {29270#(<= 3 |ackermann_#t~ret5|)} #47#return; {29110#false} is VALID [2022-02-21 03:26:21,940 INFO L290 TraceCheckUtils]: 58: Hoare triple {29110#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {29110#false} is VALID [2022-02-21 03:26:21,940 INFO L290 TraceCheckUtils]: 59: Hoare triple {29110#false} assume true; {29110#false} is VALID [2022-02-21 03:26:21,940 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {29110#false} {29109#true} #43#return; {29110#false} is VALID [2022-02-21 03:26:21,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {29109#true} assume 0 == ~n; {29109#true} is VALID [2022-02-21 03:26:21,941 INFO L272 TraceCheckUtils]: 3: Hoare triple {29109#true} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {29109#true} assume !(0 == ~n); {29109#true} is VALID [2022-02-21 03:26:21,941 INFO L272 TraceCheckUtils]: 7: Hoare triple {29109#true} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:21,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {29109#true} assume 0 == ~n; {29109#true} is VALID [2022-02-21 03:26:21,942 INFO L272 TraceCheckUtils]: 11: Hoare triple {29109#true} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {29109#true} assume !(0 == ~n); {29109#true} is VALID [2022-02-21 03:26:21,943 INFO L272 TraceCheckUtils]: 15: Hoare triple {29109#true} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:21,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {29109#true} assume 0 == ~n; {29109#true} is VALID [2022-02-21 03:26:21,943 INFO L272 TraceCheckUtils]: 19: Hoare triple {29109#true} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29342#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:26:21,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {29342#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:21,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:21,945 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {29109#true} #43#return; {29340#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:21,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {29340#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {29341#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {29341#(<= 2 |ackermann_#res|)} assume true; {29341#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,947 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29341#(<= 2 |ackermann_#res|)} {29109#true} #45#return; {29330#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:21,947 INFO L272 TraceCheckUtils]: 27: Hoare triple {29330#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:21,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:21,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:21,949 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {29330#(<= 2 |ackermann_#t~ret5|)} #47#return; {29335#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:21,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {29335#(<= 3 |ackermann_#t~ret6|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {29318#(<= 3 |ackermann_#res|)} assume true; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,956 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29318#(<= 3 |ackermann_#res|)} {29109#true} #43#return; {29317#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:21,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {29317#(<= 3 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {29318#(<= 3 |ackermann_#res|)} assume true; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,957 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {29318#(<= 3 |ackermann_#res|)} {29109#true} #45#return; {29270#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:21,958 INFO L272 TraceCheckUtils]: 38: Hoare triple {29270#(<= 3 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:21,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,958 INFO L290 TraceCheckUtils]: 40: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,959 INFO L272 TraceCheckUtils]: 42: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:21,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,960 INFO L272 TraceCheckUtils]: 46: Hoare triple {29362#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {29109#true} assume 0 == ~m;#res := 1 + ~n; {29109#true} is VALID [2022-02-21 03:26:21,960 INFO L290 TraceCheckUtils]: 49: Hoare triple {29109#true} assume true; {29109#true} is VALID [2022-02-21 03:26:21,961 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29109#true} {29362#(= |ackermann_#in~n| 0)} #43#return; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,961 INFO L290 TraceCheckUtils]: 51: Hoare triple {29362#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,962 INFO L290 TraceCheckUtils]: 52: Hoare triple {29362#(= |ackermann_#in~n| 0)} assume true; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,962 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29362#(= |ackermann_#in~n| 0)} {29344#(= ackermann_~n |ackermann_#in~n|)} #45#return; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,962 INFO L272 TraceCheckUtils]: 54: Hoare triple {29357#(<= |ackermann_#in~n| 1)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:21,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,963 INFO L290 TraceCheckUtils]: 56: Hoare triple {29109#true} assume 0 == ~m;#res := 1 + ~n; {29109#true} is VALID [2022-02-21 03:26:21,963 INFO L290 TraceCheckUtils]: 57: Hoare triple {29109#true} assume true; {29109#true} is VALID [2022-02-21 03:26:21,964 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29109#true} {29357#(<= |ackermann_#in~n| 1)} #47#return; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,964 INFO L290 TraceCheckUtils]: 59: Hoare triple {29357#(<= |ackermann_#in~n| 1)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,964 INFO L290 TraceCheckUtils]: 60: Hoare triple {29357#(<= |ackermann_#in~n| 1)} assume true; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,965 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {29357#(<= |ackermann_#in~n| 1)} {29270#(<= 3 |ackermann_#t~ret5|)} #47#return; {29110#false} is VALID [2022-02-21 03:26:21,965 INFO L290 TraceCheckUtils]: 62: Hoare triple {29110#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {29110#false} is VALID [2022-02-21 03:26:21,965 INFO L290 TraceCheckUtils]: 63: Hoare triple {29110#false} assume true; {29110#false} is VALID [2022-02-21 03:26:21,965 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29110#false} {29109#true} #43#return; {29110#false} is VALID [2022-02-21 03:26:21,966 INFO L290 TraceCheckUtils]: 65: Hoare triple {29110#false} #res := #t~ret4;havoc #t~ret4; {29110#false} is VALID [2022-02-21 03:26:21,966 INFO L290 TraceCheckUtils]: 66: Hoare triple {29110#false} assume true; {29110#false} is VALID [2022-02-21 03:26:21,966 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {29110#false} {29109#true} #45#return; {29110#false} is VALID [2022-02-21 03:26:21,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {29109#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:21,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {29109#true} assume !(0 == ~n); {29109#true} is VALID [2022-02-21 03:26:21,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {29109#true} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:21,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {29109#true} assume !(0 == ~n); {29109#true} is VALID [2022-02-21 03:26:21,967 INFO L272 TraceCheckUtils]: 8: Hoare triple {29109#true} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:21,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {29109#true} assume 0 == ~n; {29109#true} is VALID [2022-02-21 03:26:21,968 INFO L272 TraceCheckUtils]: 12: Hoare triple {29109#true} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {29109#true} assume !(0 == ~n); {29109#true} is VALID [2022-02-21 03:26:21,968 INFO L272 TraceCheckUtils]: 16: Hoare triple {29109#true} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:21,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {29109#true} assume 0 == ~n; {29109#true} is VALID [2022-02-21 03:26:21,969 INFO L272 TraceCheckUtils]: 20: Hoare triple {29109#true} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {29109#true} assume !(0 == ~n); {29109#true} is VALID [2022-02-21 03:26:21,969 INFO L272 TraceCheckUtils]: 24: Hoare triple {29109#true} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:21,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:21,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {29109#true} assume 0 == ~n; {29109#true} is VALID [2022-02-21 03:26:21,970 INFO L272 TraceCheckUtils]: 28: Hoare triple {29109#true} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29342#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} is VALID [2022-02-21 03:26:21,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {29342#(or (= (+ ackermann_~n (- 1)) 0) (= ackermann_~n |ackermann_#in~n|))} assume 0 == ~m;#res := 1 + ~n; {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:21,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} assume true; {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} is VALID [2022-02-21 03:26:21,972 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {29343#(or (<= 2 |ackermann_#res|) (not (= |ackermann_#in~n| 1)))} {29109#true} #43#return; {29340#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:21,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {29340#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {29341#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {29341#(<= 2 |ackermann_#res|)} assume true; {29341#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,973 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29341#(<= 2 |ackermann_#res|)} {29109#true} #45#return; {29330#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:21,973 INFO L272 TraceCheckUtils]: 36: Hoare triple {29330#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:21,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:21,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:21,975 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {29330#(<= 2 |ackermann_#t~ret5|)} #47#return; {29335#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:21,976 INFO L290 TraceCheckUtils]: 41: Hoare triple {29335#(<= 3 |ackermann_#t~ret6|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,976 INFO L290 TraceCheckUtils]: 42: Hoare triple {29318#(<= 3 |ackermann_#res|)} assume true; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,977 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {29318#(<= 3 |ackermann_#res|)} {29109#true} #43#return; {29317#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:21,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {29317#(<= 3 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {29318#(<= 3 |ackermann_#res|)} assume true; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:21,978 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29318#(<= 3 |ackermann_#res|)} {29109#true} #45#return; {29270#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:21,978 INFO L272 TraceCheckUtils]: 47: Hoare triple {29270#(<= 3 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:21,978 INFO L290 TraceCheckUtils]: 48: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,979 INFO L290 TraceCheckUtils]: 49: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,979 INFO L290 TraceCheckUtils]: 50: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~n); {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,979 INFO L272 TraceCheckUtils]: 51: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:21,980 INFO L290 TraceCheckUtils]: 52: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,980 INFO L290 TraceCheckUtils]: 53: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {29344#(= ackermann_~n |ackermann_#in~n|)} is VALID [2022-02-21 03:26:21,980 INFO L290 TraceCheckUtils]: 54: Hoare triple {29344#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,980 INFO L272 TraceCheckUtils]: 55: Hoare triple {29362#(= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:21,981 INFO L290 TraceCheckUtils]: 56: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,981 INFO L290 TraceCheckUtils]: 57: Hoare triple {29109#true} assume 0 == ~m;#res := 1 + ~n; {29109#true} is VALID [2022-02-21 03:26:21,981 INFO L290 TraceCheckUtils]: 58: Hoare triple {29109#true} assume true; {29109#true} is VALID [2022-02-21 03:26:21,981 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29109#true} {29362#(= |ackermann_#in~n| 0)} #43#return; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,982 INFO L290 TraceCheckUtils]: 60: Hoare triple {29362#(= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,982 INFO L290 TraceCheckUtils]: 61: Hoare triple {29362#(= |ackermann_#in~n| 0)} assume true; {29362#(= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:21,983 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {29362#(= |ackermann_#in~n| 0)} {29344#(= ackermann_~n |ackermann_#in~n|)} #45#return; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,983 INFO L272 TraceCheckUtils]: 63: Hoare triple {29357#(<= |ackermann_#in~n| 1)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:21,983 INFO L290 TraceCheckUtils]: 64: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:21,983 INFO L290 TraceCheckUtils]: 65: Hoare triple {29109#true} assume 0 == ~m;#res := 1 + ~n; {29109#true} is VALID [2022-02-21 03:26:21,983 INFO L290 TraceCheckUtils]: 66: Hoare triple {29109#true} assume true; {29109#true} is VALID [2022-02-21 03:26:21,984 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {29109#true} {29357#(<= |ackermann_#in~n| 1)} #47#return; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,984 INFO L290 TraceCheckUtils]: 68: Hoare triple {29357#(<= |ackermann_#in~n| 1)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,985 INFO L290 TraceCheckUtils]: 69: Hoare triple {29357#(<= |ackermann_#in~n| 1)} assume true; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:21,985 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {29357#(<= |ackermann_#in~n| 1)} {29270#(<= 3 |ackermann_#t~ret5|)} #47#return; {29110#false} is VALID [2022-02-21 03:26:21,985 INFO L290 TraceCheckUtils]: 71: Hoare triple {29110#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {29110#false} is VALID [2022-02-21 03:26:21,986 INFO L290 TraceCheckUtils]: 72: Hoare triple {29110#false} assume true; {29110#false} is VALID [2022-02-21 03:26:21,986 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {29110#false} {29109#true} #43#return; {29110#false} is VALID [2022-02-21 03:26:21,986 INFO L290 TraceCheckUtils]: 74: Hoare triple {29110#false} #res := #t~ret4;havoc #t~ret4; {29110#false} is VALID [2022-02-21 03:26:21,986 INFO L290 TraceCheckUtils]: 75: Hoare triple {29110#false} assume true; {29110#false} is VALID [2022-02-21 03:26:21,986 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29110#false} {29109#true} #45#return; {29110#false} is VALID [2022-02-21 03:26:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 118 proven. 61 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-02-21 03:26:21,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:26:21,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548765216] [2022-02-21 03:26:21,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548765216] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:26:21,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915486622] [2022-02-21 03:26:21,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:26:21,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:26:21,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:21,992 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:26:21,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2022-02-21 03:26:22,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-02-21 03:26:22,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:26:22,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-21 03:26:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:22,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:22,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {29109#true} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:22,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:22,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:22,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {29109#true} assume !(0 == ~n); {29109#true} is VALID [2022-02-21 03:26:22,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {29109#true} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:22,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:22,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:22,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {29109#true} assume !(0 == ~n); {29109#true} is VALID [2022-02-21 03:26:22,394 INFO L272 TraceCheckUtils]: 8: Hoare triple {29109#true} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:22,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:22,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:22,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {29109#true} assume 0 == ~n; {29109#true} is VALID [2022-02-21 03:26:22,394 INFO L272 TraceCheckUtils]: 12: Hoare triple {29109#true} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:22,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:22,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:22,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {29109#true} assume !(0 == ~n); {29109#true} is VALID [2022-02-21 03:26:22,394 INFO L272 TraceCheckUtils]: 16: Hoare triple {29109#true} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:22,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:22,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:22,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {29109#true} assume 0 == ~n; {29109#true} is VALID [2022-02-21 03:26:22,395 INFO L272 TraceCheckUtils]: 20: Hoare triple {29109#true} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:22,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:22,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:22,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {29109#true} assume !(0 == ~n); {29109#true} is VALID [2022-02-21 03:26:22,395 INFO L272 TraceCheckUtils]: 24: Hoare triple {29109#true} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:22,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:22,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {29109#true} assume !(0 == ~m); {29109#true} is VALID [2022-02-21 03:26:22,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {29109#true} assume 0 == ~n; {29109#true} is VALID [2022-02-21 03:26:22,395 INFO L272 TraceCheckUtils]: 28: Hoare triple {29109#true} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:22,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29457#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:22,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {29457#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:22,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:22,397 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {29109#true} #43#return; {29340#(<= 2 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:22,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {29340#(<= 2 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {29341#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:22,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {29341#(<= 2 |ackermann_#res|)} assume true; {29341#(<= 2 |ackermann_#res|)} is VALID [2022-02-21 03:26:22,398 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29341#(<= 2 |ackermann_#res|)} {29109#true} #45#return; {29330#(<= 2 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:22,398 INFO L272 TraceCheckUtils]: 36: Hoare triple {29330#(<= 2 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:22,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29457#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:22,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {29457#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:22,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2022-02-21 03:26:22,400 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29345#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {29330#(<= 2 |ackermann_#t~ret5|)} #47#return; {29335#(<= 3 |ackermann_#t~ret6|)} is VALID [2022-02-21 03:26:22,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {29335#(<= 3 |ackermann_#t~ret6|)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:22,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {29318#(<= 3 |ackermann_#res|)} assume true; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:22,401 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {29318#(<= 3 |ackermann_#res|)} {29109#true} #43#return; {29317#(<= 3 |ackermann_#t~ret4|)} is VALID [2022-02-21 03:26:22,402 INFO L290 TraceCheckUtils]: 44: Hoare triple {29317#(<= 3 |ackermann_#t~ret4|)} #res := #t~ret4;havoc #t~ret4; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:22,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {29318#(<= 3 |ackermann_#res|)} assume true; {29318#(<= 3 |ackermann_#res|)} is VALID [2022-02-21 03:26:22,402 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29318#(<= 3 |ackermann_#res|)} {29109#true} #45#return; {29270#(<= 3 |ackermann_#t~ret5|)} is VALID [2022-02-21 03:26:22,402 INFO L272 TraceCheckUtils]: 47: Hoare triple {29270#(<= 3 |ackermann_#t~ret5|)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:22,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29457#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:22,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {29457#(<= |ackermann_#in~n| ackermann_~n)} assume !(0 == ~m); {29457#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:22,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {29457#(<= |ackermann_#in~n| ackermann_~n)} assume !(0 == ~n); {29457#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:22,403 INFO L272 TraceCheckUtils]: 51: Hoare triple {29457#(<= |ackermann_#in~n| ackermann_~n)} call #t~ret5 := ackermann(~m, ~n - 1); {29109#true} is VALID [2022-02-21 03:26:22,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29457#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:22,404 INFO L290 TraceCheckUtils]: 53: Hoare triple {29457#(<= |ackermann_#in~n| ackermann_~n)} assume !(0 == ~m); {29457#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2022-02-21 03:26:22,404 INFO L290 TraceCheckUtils]: 54: Hoare triple {29457#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~n; {29533#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:22,404 INFO L272 TraceCheckUtils]: 55: Hoare triple {29533#(<= |ackermann_#in~n| 0)} call #t~ret4 := ackermann(~m - 1, 1); {29109#true} is VALID [2022-02-21 03:26:22,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:22,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {29109#true} assume 0 == ~m;#res := 1 + ~n; {29109#true} is VALID [2022-02-21 03:26:22,405 INFO L290 TraceCheckUtils]: 58: Hoare triple {29109#true} assume true; {29109#true} is VALID [2022-02-21 03:26:22,405 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29109#true} {29533#(<= |ackermann_#in~n| 0)} #43#return; {29533#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:22,405 INFO L290 TraceCheckUtils]: 60: Hoare triple {29533#(<= |ackermann_#in~n| 0)} #res := #t~ret4;havoc #t~ret4; {29533#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:22,406 INFO L290 TraceCheckUtils]: 61: Hoare triple {29533#(<= |ackermann_#in~n| 0)} assume true; {29533#(<= |ackermann_#in~n| 0)} is VALID [2022-02-21 03:26:22,406 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {29533#(<= |ackermann_#in~n| 0)} {29457#(<= |ackermann_#in~n| ackermann_~n)} #45#return; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:22,406 INFO L272 TraceCheckUtils]: 63: Hoare triple {29357#(<= |ackermann_#in~n| 1)} call #t~ret6 := ackermann(~m - 1, #t~ret5); {29109#true} is VALID [2022-02-21 03:26:22,407 INFO L290 TraceCheckUtils]: 64: Hoare triple {29109#true} ~m := #in~m;~n := #in~n; {29109#true} is VALID [2022-02-21 03:26:22,407 INFO L290 TraceCheckUtils]: 65: Hoare triple {29109#true} assume 0 == ~m;#res := 1 + ~n; {29109#true} is VALID [2022-02-21 03:26:22,407 INFO L290 TraceCheckUtils]: 66: Hoare triple {29109#true} assume true; {29109#true} is VALID [2022-02-21 03:26:22,407 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {29109#true} {29357#(<= |ackermann_#in~n| 1)} #47#return; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:22,407 INFO L290 TraceCheckUtils]: 68: Hoare triple {29357#(<= |ackermann_#in~n| 1)} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:22,408 INFO L290 TraceCheckUtils]: 69: Hoare triple {29357#(<= |ackermann_#in~n| 1)} assume true; {29357#(<= |ackermann_#in~n| 1)} is VALID [2022-02-21 03:26:22,408 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {29357#(<= |ackermann_#in~n| 1)} {29270#(<= 3 |ackermann_#t~ret5|)} #47#return; {29110#false} is VALID [2022-02-21 03:26:22,409 INFO L290 TraceCheckUtils]: 71: Hoare triple {29110#false} #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; {29110#false} is VALID [2022-02-21 03:26:22,409 INFO L290 TraceCheckUtils]: 72: Hoare triple {29110#false} assume true; {29110#false} is VALID [2022-02-21 03:26:22,409 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {29110#false} {29109#true} #43#return; {29110#false} is VALID [2022-02-21 03:26:22,409 INFO L290 TraceCheckUtils]: 74: Hoare triple {29110#false} #res := #t~ret4;havoc #t~ret4; {29110#false} is VALID [2022-02-21 03:26:22,409 INFO L290 TraceCheckUtils]: 75: Hoare triple {29110#false} assume true; {29110#false} is VALID [2022-02-21 03:26:22,409 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29110#false} {29109#true} #45#return; {29110#false} is VALID [2022-02-21 03:26:22,409 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 105 proven. 69 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-02-21 03:26:22,409 INFO L328 TraceCheckSpWp]: Computing backward predicates...