./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/Ackermann01-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-?-574ddb4 [2023-02-19 00:14:41,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-19 00:14:41,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-19 00:14:41,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-19 00:14:41,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-19 00:14:41,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-19 00:14:41,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-19 00:14:41,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-19 00:14:41,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-19 00:14:41,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-19 00:14:41,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-19 00:14:41,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-19 00:14:41,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-19 00:14:41,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-19 00:14:41,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-19 00:14:41,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-19 00:14:41,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-19 00:14:41,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-19 00:14:41,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-19 00:14:41,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-19 00:14:41,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-19 00:14:41,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-19 00:14:41,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-19 00:14:41,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-19 00:14:41,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-19 00:14:41,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-19 00:14:41,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-19 00:14:41,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-19 00:14:41,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-19 00:14:41,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-19 00:14:41,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-19 00:14:41,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-19 00:14:41,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-19 00:14:41,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-19 00:14:41,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-19 00:14:41,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-19 00:14:41,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-19 00:14:41,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-19 00:14:41,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-19 00:14:41,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-19 00:14:41,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-19 00:14:41,750 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-19 00:14:41,774 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-19 00:14:41,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-19 00:14:41,775 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-19 00:14:41,785 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-19 00:14:41,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-19 00:14:41,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-19 00:14:41,787 INFO L138 SettingsManager]: * Use SBE=true [2023-02-19 00:14:41,787 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-19 00:14:41,787 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-19 00:14:41,787 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-19 00:14:41,788 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-19 00:14:41,788 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-19 00:14:41,788 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-19 00:14:41,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-19 00:14:41,788 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-19 00:14:41,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-19 00:14:41,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-19 00:14:41,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-19 00:14:41,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-19 00:14:41,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-19 00:14:41,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-19 00:14:41,789 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-19 00:14:41,790 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-19 00:14:41,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-19 00:14:41,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-19 00:14:41,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-19 00:14:41,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-19 00:14:41,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-19 00:14:41,792 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-19 00:14:41,792 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 [2023-02-19 00:14:41,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-19 00:14:41,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-19 00:14:41,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-19 00:14:41,989 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-19 00:14:41,990 INFO L275 PluginConnector]: CDTParser initialized [2023-02-19 00:14:41,991 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Ackermann01-1.c [2023-02-19 00:14:42,938 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-19 00:14:43,099 INFO L351 CDTParser]: Found 1 translation units. [2023-02-19 00:14:43,100 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Ackermann01-1.c [2023-02-19 00:14:43,103 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a6c73a5/3e657df056df488e92eabab49379dc4c/FLAG0f721855b [2023-02-19 00:14:43,112 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a6c73a5/3e657df056df488e92eabab49379dc4c [2023-02-19 00:14:43,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-19 00:14:43,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-19 00:14:43,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-19 00:14:43,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-19 00:14:43,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-19 00:14:43,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 12:14:43" (1/1) ... [2023-02-19 00:14:43,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e09900a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:14:43, skipping insertion in model container [2023-02-19 00:14:43,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 12:14:43" (1/1) ... [2023-02-19 00:14:43,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-19 00:14:43,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-19 00:14:43,244 WARN L237 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] [2023-02-19 00:14:43,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-19 00:14:43,251 INFO L203 MainTranslator]: Completed pre-run [2023-02-19 00:14:43,260 WARN L237 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] [2023-02-19 00:14:43,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-19 00:14:43,268 INFO L208 MainTranslator]: Completed translation [2023-02-19 00:14:43,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:14:43 WrapperNode [2023-02-19 00:14:43,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-19 00:14:43,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-19 00:14:43,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-19 00:14:43,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-19 00:14:43,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:14:43" (1/1) ... [2023-02-19 00:14:43,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:14:43" (1/1) ... [2023-02-19 00:14:43,287 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2023-02-19 00:14:43,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-19 00:14:43,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-19 00:14:43,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-19 00:14:43,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-19 00:14:43,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:14:43" (1/1) ... [2023-02-19 00:14:43,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:14:43" (1/1) ... [2023-02-19 00:14:43,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:14:43" (1/1) ... [2023-02-19 00:14:43,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:14:43" (1/1) ... [2023-02-19 00:14:43,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:14:43" (1/1) ... [2023-02-19 00:14:43,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:14:43" (1/1) ... [2023-02-19 00:14:43,308 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:14:43" (1/1) ... [2023-02-19 00:14:43,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:14:43" (1/1) ... [2023-02-19 00:14:43,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-19 00:14:43,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-19 00:14:43,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-19 00:14:43,310 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-19 00:14:43,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:14:43" (1/1) ... [2023-02-19 00:14:43,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:43,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:43,332 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) [2023-02-19 00:14:43,353 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 [2023-02-19 00:14:43,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-19 00:14:43,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-19 00:14:43,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-19 00:14:43,360 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2023-02-19 00:14:43,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2023-02-19 00:14:43,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-19 00:14:43,407 INFO L235 CfgBuilder]: Building ICFG [2023-02-19 00:14:43,408 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-19 00:14:43,484 INFO L276 CfgBuilder]: Performing block encoding [2023-02-19 00:14:43,487 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-19 00:14:43,488 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-19 00:14:43,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 12:14:43 BoogieIcfgContainer [2023-02-19 00:14:43,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-19 00:14:43,490 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-19 00:14:43,490 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-19 00:14:43,492 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-19 00:14:43,492 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-19 00:14:43,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.02 12:14:43" (1/3) ... [2023-02-19 00:14:43,493 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@282e25ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.02 12:14:43, skipping insertion in model container [2023-02-19 00:14:43,493 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-19 00:14:43,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 12:14:43" (2/3) ... [2023-02-19 00:14:43,494 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@282e25ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.02 12:14:43, skipping insertion in model container [2023-02-19 00:14:43,494 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-19 00:14:43,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 12:14:43" (3/3) ... [2023-02-19 00:14:43,495 INFO L332 chiAutomizerObserver]: Analyzing ICFG Ackermann01-1.c [2023-02-19 00:14:43,525 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-19 00:14:43,525 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-19 00:14:43,525 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-19 00:14:43,525 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-19 00:14:43,525 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-19 00:14:43,525 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-19 00:14:43,525 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-19 00:14:43,526 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-19 00:14:43,528 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) [2023-02-19 00:14:43,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-19 00:14:43,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:14:43,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:14:43,543 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-19 00:14:43,543 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-19 00:14:43,543 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-19 00:14:43,543 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) [2023-02-19 00:14:43,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-19 00:14:43,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:14:43,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:14:43,546 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-19 00:14:43,546 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-19 00:14:43,550 INFO L748 eck$LassoCheckResult]: Stem: 18#$Ultimate##0true 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); 7#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; 5#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; 6#L33true assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 8#L36true call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 9#$Ultimate##0true [2023-02-19 00:14:43,550 INFO L750 eck$LassoCheckResult]: Loop: 9#$Ultimate##0true ~m := #in~m;~n := #in~n; 12#L17true assume !(0 == ~m); 13#L20true assume 0 == ~n; 15#L21true call #t~ret4 := ackermann(~m - 1, 1);< 9#$Ultimate##0true [2023-02-19 00:14:43,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:43,554 INFO L85 PathProgramCache]: Analyzing trace with hash 28695872, now seen corresponding path program 1 times [2023-02-19 00:14:43,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:43,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160726703] [2023-02-19 00:14:43,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:43,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:43,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:43,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:43,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:43,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1697199, now seen corresponding path program 1 times [2023-02-19 00:14:43,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:43,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246044792] [2023-02-19 00:14:43,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:43,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:43,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:43,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:43,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:43,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1292962670, now seen corresponding path program 1 times [2023-02-19 00:14:43,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:43,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894709057] [2023-02-19 00:14:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:43,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:43,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:43,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:43,733 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:14:43,733 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:14:43,733 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:14:43,734 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:14:43,734 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-19 00:14:43,734 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:43,734 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:14:43,734 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:14:43,735 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration1_Loop [2023-02-19 00:14:43,735 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:14:43,735 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:14:43,745 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:43,751 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:43,757 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:43,759 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:43,773 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:43,774 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:43,775 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:43,777 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:43,798 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:14:43,799 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-19 00:14:43,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:43,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:43,829 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) [2023-02-19 00:14:43,835 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:43,835 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:43,853 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 [2023-02-19 00:14:43,870 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:43,870 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:43,875 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 [2023-02-19 00:14:43,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:43,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:43,877 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) [2023-02-19 00:14:43,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:43,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:43,911 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 [2023-02-19 00:14:43,920 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:43,920 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:43,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-02-19 00:14:43,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:43,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:43,929 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) [2023-02-19 00:14:43,931 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 [2023-02-19 00:14:43,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:43,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:43,942 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:43,942 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:43,945 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 [2023-02-19 00:14:43,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:43,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:43,948 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) [2023-02-19 00:14:43,953 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 [2023-02-19 00:14:43,954 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:43,954 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:43,973 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:43,974 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:44,000 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 [2023-02-19 00:14:44,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:44,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:44,002 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) [2023-02-19 00:14:44,025 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 [2023-02-19 00:14:44,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:44,026 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:44,043 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:44,043 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:44,046 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 [2023-02-19 00:14:44,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:44,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:44,048 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) [2023-02-19 00:14:44,050 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 [2023-02-19 00:14:44,051 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:44,051 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:44,073 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:44,073 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:44,076 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 [2023-02-19 00:14:44,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:44,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:44,078 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) [2023-02-19 00:14:44,080 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 [2023-02-19 00:14:44,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:44,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:44,107 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 [2023-02-19 00:14:44,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:44,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:44,108 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) [2023-02-19 00:14:44,110 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 [2023-02-19 00:14:44,112 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-19 00:14:44,112 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:44,130 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-19 00:14:44,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-02-19 00:14:44,147 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:14:44,147 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:14:44,147 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:14:44,147 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:14:44,147 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-19 00:14:44,147 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:44,147 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:14:44,147 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:14:44,147 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration1_Loop [2023-02-19 00:14:44,148 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:14:44,148 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:14:44,149 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:44,150 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:44,151 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:44,152 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:44,153 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:44,154 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:44,155 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:44,156 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:44,162 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:14:44,170 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-19 00:14:44,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:44,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:44,172 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) [2023-02-19 00:14:44,177 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 [2023-02-19 00:14:44,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-19 00:14:44,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:44,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:44,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:44,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:44,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:44,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:44,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:44,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:44,217 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 [2023-02-19 00:14:44,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:44,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:44,219 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) [2023-02-19 00:14:44,220 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 [2023-02-19 00:14:44,222 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 [2023-02-19 00:14:44,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:44,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:44,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:44,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:44,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:44,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:44,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:44,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:44,234 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 [2023-02-19 00:14:44,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:44,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:44,236 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) [2023-02-19 00:14:44,237 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 [2023-02-19 00:14:44,238 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 [2023-02-19 00:14:44,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:44,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:44,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:44,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:44,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:44,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:44,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:44,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:44,254 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 [2023-02-19 00:14:44,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:44,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:44,255 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) [2023-02-19 00:14:44,257 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 [2023-02-19 00:14:44,258 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 [2023-02-19 00:14:44,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:44,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:44,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:44,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:44,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:44,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:44,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:44,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:44,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:44,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:44,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:44,278 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) [2023-02-19 00:14:44,281 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 [2023-02-19 00:14:44,282 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 [2023-02-19 00:14:44,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:44,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:44,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:44,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:44,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:44,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:44,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:44,303 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-19 00:14:44,306 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-19 00:14:44,306 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-19 00:14:44,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:44,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:44,344 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) [2023-02-19 00:14:44,346 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 [2023-02-19 00:14:44,346 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-19 00:14:44,346 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-19 00:14:44,346 INFO L513 LassoAnalysis]: Proved termination. [2023-02-19 00:14:44,347 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~n) = -2*ackermann_#in~n + 1 Supporting invariants [] [2023-02-19 00:14:44,353 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 [2023-02-19 00:14:44,355 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-19 00:14:44,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:44,429 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 [2023-02-19 00:14:44,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-19 00:14:44,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:44,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-19 00:14:44,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:14:44,499 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-19 00:14:44,500 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) [2023-02-19 00:14:44,572 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. [2023-02-19 00:14:44,574 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 [2023-02-19 00:14:44,577 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) [2023-02-19 00:14:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-19 00:14:44,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2023-02-19 00:14:44,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:44,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2023-02-19 00:14:44,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:44,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2023-02-19 00:14:44,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:44,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2023-02-19 00:14:44,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-19 00:14:44,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 29 states and 37 transitions. [2023-02-19 00:14:44,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-02-19 00:14:44,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2023-02-19 00:14:44,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2023-02-19 00:14:44,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:14:44,602 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-02-19 00:14:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2023-02-19 00:14:44,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2023-02-19 00:14:44,641 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) [2023-02-19 00:14:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-02-19 00:14:44,643 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-02-19 00:14:44,643 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-02-19 00:14:44,643 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-19 00:14:44,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2023-02-19 00:14:44,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-19 00:14:44,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:14:44,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:14:44,644 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-19 00:14:44,645 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-19 00:14:44,645 INFO L748 eck$LassoCheckResult]: Stem: 151#$Ultimate##0 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); 141#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; 139#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; 140#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 136#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 142#$Ultimate##0 ~m := #in~m;~n := #in~n; 143#L17 assume !(0 == ~m); 149#L20 assume !(0 == ~n); 135#L23 [2023-02-19 00:14:44,645 INFO L750 eck$LassoCheckResult]: Loop: 135#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 148#$Ultimate##0 ~m := #in~m;~n := #in~n; 152#L17 assume !(0 == ~m); 153#L20 assume !(0 == ~n); 135#L23 [2023-02-19 00:14:44,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:44,645 INFO L85 PathProgramCache]: Analyzing trace with hash 180255807, now seen corresponding path program 1 times [2023-02-19 00:14:44,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:44,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300931131] [2023-02-19 00:14:44,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:44,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:44,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:44,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:44,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:44,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2259284, now seen corresponding path program 1 times [2023-02-19 00:14:44,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:44,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370764704] [2023-02-19 00:14:44,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:44,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:44,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:44,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:44,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:44,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1387046546, now seen corresponding path program 1 times [2023-02-19 00:14:44,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:44,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616741963] [2023-02-19 00:14:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:44,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:44,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:44,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:44,731 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:14:44,731 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:14:44,731 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:14:44,731 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:14:44,731 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-19 00:14:44,731 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:44,731 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:14:44,732 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:14:44,732 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration2_Loop [2023-02-19 00:14:44,732 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:14:44,732 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:14:44,733 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:44,734 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:44,735 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:44,735 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:44,736 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:44,737 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:44,740 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:14:44,741 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-19 00:14:44,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:44,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:44,742 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) [2023-02-19 00:14:44,761 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 [2023-02-19 00:14:44,762 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:44,762 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:44,792 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 [2023-02-19 00:14:44,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:44,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:44,794 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) [2023-02-19 00:14:44,795 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 [2023-02-19 00:14:44,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-19 00:14:44,797 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:45,172 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:45,172 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=-2, ackermann_#in~n=1} Honda state: {ackermann_~n=-2, ackermann_#in~n=1} Generalized eigenvectors: [{ackermann_~n=-1, ackermann_#in~n=-1}, {ackermann_~n=0, ackermann_#in~n=0}, {ackermann_~n=0, ackermann_#in~n=-3}] Lambdas: [1, 9, 0] Nus: [0, 0] [2023-02-19 00:14:45,179 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 [2023-02-19 00:14:45,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,180 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) [2023-02-19 00:14:45,183 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 [2023-02-19 00:14:45,183 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:45,184 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:45,210 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:45,210 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:45,214 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 [2023-02-19 00:14:45,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,215 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) [2023-02-19 00:14:45,217 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 [2023-02-19 00:14:45,218 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:45,218 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:45,226 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:45,226 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:45,229 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 [2023-02-19 00:14:45,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,230 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) [2023-02-19 00:14:45,234 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 [2023-02-19 00:14:45,234 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:45,234 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:45,241 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:45,241 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:45,246 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 [2023-02-19 00:14:45,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,247 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) [2023-02-19 00:14:45,250 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 [2023-02-19 00:14:45,250 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:45,250 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:45,266 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:45,267 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-3, ackermann_~m=-3} Honda state: {ackermann_#in~m=-3, ackermann_~m=-3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:45,270 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 [2023-02-19 00:14:45,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,273 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) [2023-02-19 00:14:45,275 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 [2023-02-19 00:14:45,277 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:45,277 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:45,292 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:45,292 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:45,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:45,304 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:14:45,305 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:14:45,305 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:14:45,305 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:14:45,305 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-19 00:14:45,305 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,305 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:14:45,305 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:14:45,305 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration2_Lasso [2023-02-19 00:14:45,305 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:14:45,305 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:14:45,312 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,313 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,322 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,323 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,324 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,331 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,342 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,343 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,344 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,344 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,345 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,346 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,348 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,348 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,349 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,352 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,353 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,354 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,356 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,356 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:45,377 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:14:45,378 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-19 00:14:45,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,394 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) [2023-02-19 00:14:45,409 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 [2023-02-19 00:14:45,410 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 [2023-02-19 00:14:45,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:45,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:45,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:45,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:45,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:45,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:45,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:45,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:45,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:45,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,433 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) [2023-02-19 00:14:45,433 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 [2023-02-19 00:14:45,435 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 [2023-02-19 00:14:45,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:45,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:45,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:45,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:45,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:45,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:45,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:45,482 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 [2023-02-19 00:14:45,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,484 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) [2023-02-19 00:14:45,486 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 [2023-02-19 00:14:45,501 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 [2023-02-19 00:14:45,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:45,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:45,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:45,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:45,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:45,510 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:45,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:45,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:45,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,575 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) [2023-02-19 00:14:45,579 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 [2023-02-19 00:14:45,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:45,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:45,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:45,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:45,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:45,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:45,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:45,589 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 [2023-02-19 00:14:45,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:45,621 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 [2023-02-19 00:14:45,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,622 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) [2023-02-19 00:14:45,626 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 [2023-02-19 00:14:45,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:45,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:45,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:45,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:45,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:45,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:45,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:45,636 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 [2023-02-19 00:14:45,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:45,649 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 [2023-02-19 00:14:45,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,651 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) [2023-02-19 00:14:45,652 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 [2023-02-19 00:14:45,654 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 [2023-02-19 00:14:45,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:45,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:45,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:45,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:45,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:45,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:45,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:45,674 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 [2023-02-19 00:14:45,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,675 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) [2023-02-19 00:14:45,677 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 [2023-02-19 00:14:45,680 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 [2023-02-19 00:14:45,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:45,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:45,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:45,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:45,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:45,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:45,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:45,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:45,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,724 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) [2023-02-19 00:14:45,727 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 [2023-02-19 00:14:45,728 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 [2023-02-19 00:14:45,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:45,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:45,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:45,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:45,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:45,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:45,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:45,789 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 [2023-02-19 00:14:45,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,791 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) [2023-02-19 00:14:45,793 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 [2023-02-19 00:14:45,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 [2023-02-19 00:14:45,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:45,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:45,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:45,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:45,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:45,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:45,813 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:45,818 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 [2023-02-19 00:14:45,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,819 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) [2023-02-19 00:14:45,833 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 [2023-02-19 00:14:45,834 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 [2023-02-19 00:14:45,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:45,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:45,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:45,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:45,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:45,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:45,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:45,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:45,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,862 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) [2023-02-19 00:14:45,864 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 [2023-02-19 00:14:45,865 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 [2023-02-19 00:14:45,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:45,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:45,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:45,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:45,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:45,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:45,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:45,897 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 [2023-02-19 00:14:45,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,903 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) [2023-02-19 00:14:45,905 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 [2023-02-19 00:14:45,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-19 00:14:45,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:45,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:45,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:45,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:45,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:45,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:45,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:45,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:45,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,948 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) [2023-02-19 00:14:45,949 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 [2023-02-19 00:14:45,951 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 [2023-02-19 00:14:45,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:45,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:45,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:45,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:45,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:45,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:45,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:45,985 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 [2023-02-19 00:14:45,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:45,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:45,987 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) [2023-02-19 00:14:46,005 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 [2023-02-19 00:14:46,006 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 [2023-02-19 00:14:46,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:46,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:46,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:46,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:46,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:46,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:46,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:46,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:46,016 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 [2023-02-19 00:14:46,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,018 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) [2023-02-19 00:14:46,020 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 [2023-02-19 00:14:46,021 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 [2023-02-19 00:14:46,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:46,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:46,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:46,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:46,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:46,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:46,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:46,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:46,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:46,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,048 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) [2023-02-19 00:14:46,061 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 [2023-02-19 00:14:46,064 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 [2023-02-19 00:14:46,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:46,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:46,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:46,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:46,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:46,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:46,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:46,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:46,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:46,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,075 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) [2023-02-19 00:14:46,078 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 [2023-02-19 00:14:46,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 [2023-02-19 00:14:46,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:46,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:46,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:46,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:46,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:46,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:46,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:46,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:46,104 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 [2023-02-19 00:14:46,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,106 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) [2023-02-19 00:14:46,108 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 [2023-02-19 00:14:46,109 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 [2023-02-19 00:14:46,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:46,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:46,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:46,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:46,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:46,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:46,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:46,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:46,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:46,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,157 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) [2023-02-19 00:14:46,159 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 [2023-02-19 00:14:46,161 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 [2023-02-19 00:14:46,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:46,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:46,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:46,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:46,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:46,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:46,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:46,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:46,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:46,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,189 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) [2023-02-19 00:14:46,191 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 [2023-02-19 00:14:46,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 [2023-02-19 00:14:46,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:46,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:46,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:46,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:46,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:46,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:46,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:46,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:46,201 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 [2023-02-19 00:14:46,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,203 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) [2023-02-19 00:14:46,209 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 [2023-02-19 00:14:46,209 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 [2023-02-19 00:14:46,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:46,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:46,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:46,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:46,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:46,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:46,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:46,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:46,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:46,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,223 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) [2023-02-19 00:14:46,226 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 [2023-02-19 00:14:46,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-19 00:14:46,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:46,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:46,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:46,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:46,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:46,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:46,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:46,253 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 [2023-02-19 00:14:46,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,255 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) [2023-02-19 00:14:46,257 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 [2023-02-19 00:14:46,258 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 [2023-02-19 00:14:46,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:46,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:46,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:46,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:46,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:46,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:46,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:46,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:46,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:46,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,272 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) [2023-02-19 00:14:46,274 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 [2023-02-19 00:14:46,275 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 [2023-02-19 00:14:46,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:46,281 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-02-19 00:14:46,281 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-19 00:14:46,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:46,288 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2023-02-19 00:14:46,288 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-02-19 00:14:46,309 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-19 00:14:46,323 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-02-19 00:14:46,323 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-02-19 00:14:46,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,325 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) [2023-02-19 00:14:46,326 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 [2023-02-19 00:14:46,327 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-19 00:14:46,336 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-02-19 00:14:46,336 INFO L513 LassoAnalysis]: Proved termination. [2023-02-19 00:14:46,336 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~n) = 1*ackermann_~n Supporting invariants [2*ackermann_~n - 1 >= 0] [2023-02-19 00:14:46,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:46,342 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2023-02-19 00:14:46,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:46,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-19 00:14:46,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:46,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-19 00:14:46,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:46,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:14:46,438 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2023-02-19 00:14:46,438 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) [2023-02-19 00:14:46,476 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. [2023-02-19 00:14:46,477 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 [2023-02-19 00:14:46,477 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) [2023-02-19 00:14:46,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2023-02-19 00:14:46,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2023-02-19 00:14:46,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:46,478 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-19 00:14:46,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:46,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-19 00:14:46,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:46,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-19 00:14:46,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:14:46,542 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2023-02-19 00:14:46,542 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) [2023-02-19 00:14:46,592 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. [2023-02-19 00:14:46,593 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 [2023-02-19 00:14:46,593 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) [2023-02-19 00:14:46,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2023-02-19 00:14:46,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 4 letters. [2023-02-19 00:14:46,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:46,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 12 letters. Loop has 4 letters. [2023-02-19 00:14:46,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:46,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 8 letters. [2023-02-19 00:14:46,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:46,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 67 transitions. [2023-02-19 00:14:46,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-19 00:14:46,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 42 states and 59 transitions. [2023-02-19 00:14:46,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-02-19 00:14:46,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-02-19 00:14:46,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 59 transitions. [2023-02-19 00:14:46,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:14:46,599 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 59 transitions. [2023-02-19 00:14:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 59 transitions. [2023-02-19 00:14:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2023-02-19 00:14:46,602 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) [2023-02-19 00:14:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2023-02-19 00:14:46,603 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 45 transitions. [2023-02-19 00:14:46,603 INFO L428 stractBuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2023-02-19 00:14:46,603 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-19 00:14:46,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2023-02-19 00:14:46,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-19 00:14:46,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:14:46,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:14:46,605 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-19 00:14:46,605 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-19 00:14:46,605 INFO L748 eck$LassoCheckResult]: Stem: 418#$Ultimate##0 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); 405#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; 402#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; 403#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 393#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 404#$Ultimate##0 ~m := #in~m;~n := #in~n; 407#L17 assume !(0 == ~m); 411#L20 assume !(0 == ~n); 397#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 417#$Ultimate##0 ~m := #in~m;~n := #in~n; 424#L17 assume !(0 == ~m); 413#L20 assume 0 == ~n; 399#L21 [2023-02-19 00:14:46,605 INFO L750 eck$LassoCheckResult]: Loop: 399#L21 call #t~ret4 := ackermann(~m - 1, 1);< 410#$Ultimate##0 ~m := #in~m;~n := #in~n; 422#L17 assume !(0 == ~m); 423#L20 assume 0 == ~n; 399#L21 [2023-02-19 00:14:46,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:46,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1387046543, now seen corresponding path program 1 times [2023-02-19 00:14:46,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:46,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047565784] [2023-02-19 00:14:46,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:46,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:46,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:46,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:46,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:46,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2199699, now seen corresponding path program 2 times [2023-02-19 00:14:46,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:46,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728913206] [2023-02-19 00:14:46,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:46,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:14:46,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:14:46,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728913206] [2023-02-19 00:14:46,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728913206] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-19 00:14:46,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-19 00:14:46,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-19 00:14:46,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408002039] [2023-02-19 00:14:46,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-19 00:14:46,658 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-19 00:14:46,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:14:46,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-19 00:14:46,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-19 00:14:46,661 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) [2023-02-19 00:14:46,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:14:46,685 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2023-02-19 00:14:46,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2023-02-19 00:14:46,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2023-02-19 00:14:46,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 45 states and 61 transitions. [2023-02-19 00:14:46,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-02-19 00:14:46,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2023-02-19 00:14:46,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 61 transitions. [2023-02-19 00:14:46,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:14:46,692 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 61 transitions. [2023-02-19 00:14:46,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 61 transitions. [2023-02-19 00:14:46,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2023-02-19 00:14:46,695 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) [2023-02-19 00:14:46,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2023-02-19 00:14:46,696 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 60 transitions. [2023-02-19 00:14:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-19 00:14:46,696 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2023-02-19 00:14:46,697 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-19 00:14:46,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 60 transitions. [2023-02-19 00:14:46,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2023-02-19 00:14:46,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:14:46,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:14:46,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-19 00:14:46,698 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2023-02-19 00:14:46,698 INFO L748 eck$LassoCheckResult]: Stem: 508#$Ultimate##0 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); 489#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; 486#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; 487#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 488#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 490#$Ultimate##0 ~m := #in~m;~n := #in~n; 515#L17 assume !(0 == ~m); 524#L20 assume !(0 == ~n); 483#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 507#$Ultimate##0 ~m := #in~m;~n := #in~n; 523#L17 assume !(0 == ~m); 520#L20 assume 0 == ~n; 510#L21 [2023-02-19 00:14:46,698 INFO L750 eck$LassoCheckResult]: Loop: 510#L21 call #t~ret4 := ackermann(~m - 1, 1);< 511#$Ultimate##0 ~m := #in~m;~n := #in~n; 517#L17 assume !(0 == ~m); 518#L20 assume !(0 == ~n); 502#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 500#$Ultimate##0 ~m := #in~m;~n := #in~n; 521#L17 assume !(0 == ~m); 522#L20 assume 0 == ~n; 510#L21 [2023-02-19 00:14:46,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:46,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1387046543, now seen corresponding path program 2 times [2023-02-19 00:14:46,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:46,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302260199] [2023-02-19 00:14:46,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:46,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:46,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:46,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:46,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:46,713 INFO L85 PathProgramCache]: Analyzing trace with hash -47204506, now seen corresponding path program 1 times [2023-02-19 00:14:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:46,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365381285] [2023-02-19 00:14:46,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:46,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:46,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:46,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:46,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:46,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2117341196, now seen corresponding path program 1 times [2023-02-19 00:14:46,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:46,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213632168] [2023-02-19 00:14:46,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:46,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:46,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:46,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:46,757 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:14:46,757 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:14:46,757 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:14:46,757 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:14:46,757 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-19 00:14:46,757 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,757 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:14:46,757 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:14:46,758 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration4_Loop [2023-02-19 00:14:46,758 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:14:46,758 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:14:46,758 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:46,759 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:46,760 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:46,760 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:46,761 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:46,762 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:46,764 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:14:46,764 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-19 00:14:46,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,774 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) [2023-02-19 00:14:46,775 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 [2023-02-19 00:14:46,776 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:46,777 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:46,787 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:46,787 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0, ackermann_#in~n=0} Honda state: {ackermann_~n=0, ackermann_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:46,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:46,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,792 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) [2023-02-19 00:14:46,794 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 [2023-02-19 00:14:46,795 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:46,795 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:46,802 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:46,802 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:46,804 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 [2023-02-19 00:14:46,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,806 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) [2023-02-19 00:14:46,807 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 [2023-02-19 00:14:46,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:46,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:46,815 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:46,815 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:46,818 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 [2023-02-19 00:14:46,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,820 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) [2023-02-19 00:14:46,821 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 [2023-02-19 00:14:46,823 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:46,823 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:46,830 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:46,830 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:46,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:46,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,835 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) [2023-02-19 00:14:46,836 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 [2023-02-19 00:14:46,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:46,838 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:46,844 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:46,844 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:46,847 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 [2023-02-19 00:14:46,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,849 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) [2023-02-19 00:14:46,850 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 [2023-02-19 00:14:46,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:46,851 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:46,877 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 [2023-02-19 00:14:46,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:46,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:46,878 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) [2023-02-19 00:14:46,880 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 [2023-02-19 00:14:46,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-19 00:14:46,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:47,128 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:47,128 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-3, ackermann_~m=-7} Honda state: {ackermann_#in~m=-3, ackermann_~m=-7} Generalized eigenvectors: [{ackermann_#in~m=-4, ackermann_~m=0}, {ackermann_#in~m=-1, ackermann_~m=-1}, {ackermann_#in~m=0, ackermann_~m=0}] Lambdas: [0, 1, 5] Nus: [0, 1] [2023-02-19 00:14:47,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:47,140 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:14:47,140 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:14:47,141 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:14:47,141 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:14:47,141 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-19 00:14:47,141 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,141 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:14:47,141 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:14:47,141 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration4_Lasso [2023-02-19 00:14:47,141 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:14:47,141 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:14:47,142 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,152 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,153 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,153 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,154 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,160 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,160 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,161 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,162 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,162 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,163 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,164 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,164 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,165 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,165 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,166 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,167 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,170 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,171 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,172 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:47,178 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:14:47,178 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-19 00:14:47,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,179 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) [2023-02-19 00:14:47,199 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 [2023-02-19 00:14:47,199 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 [2023-02-19 00:14:47,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:47,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:47,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,219 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 [2023-02-19 00:14:47,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,228 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) [2023-02-19 00:14:47,230 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 [2023-02-19 00:14:47,238 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 [2023-02-19 00:14:47,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:47,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:47,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:47,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,290 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) [2023-02-19 00:14:47,293 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 [2023-02-19 00:14:47,293 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 [2023-02-19 00:14:47,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:47,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:47,310 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:47,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,349 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) [2023-02-19 00:14:47,370 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 [2023-02-19 00:14:47,373 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 [2023-02-19 00:14:47,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:47,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:47,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:47,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,394 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) [2023-02-19 00:14:47,397 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 [2023-02-19 00:14:47,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:47,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:47,407 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 [2023-02-19 00:14:47,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,423 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 [2023-02-19 00:14:47,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,424 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) [2023-02-19 00:14:47,437 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 [2023-02-19 00:14:47,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:47,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:47,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:47,446 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 [2023-02-19 00:14:47,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,451 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 [2023-02-19 00:14:47,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,452 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) [2023-02-19 00:14:47,453 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 [2023-02-19 00:14:47,455 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 [2023-02-19 00:14:47,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:47,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:47,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:47,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:47,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,479 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) [2023-02-19 00:14:47,480 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 [2023-02-19 00:14:47,482 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 [2023-02-19 00:14:47,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:47,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:47,504 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:47,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,507 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) [2023-02-19 00:14:47,509 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 [2023-02-19 00:14:47,510 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 [2023-02-19 00:14:47,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:47,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:47,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,529 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 [2023-02-19 00:14:47,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,531 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) [2023-02-19 00:14:47,532 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 [2023-02-19 00:14:47,534 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 [2023-02-19 00:14:47,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:47,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:47,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,558 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 [2023-02-19 00:14:47,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,563 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-19 00:14:47,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2023-02-19 00:14:47,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-19 00:14:47,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:47,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:47,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:47,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:47,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,584 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) [2023-02-19 00:14:47,586 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 [2023-02-19 00:14:47,587 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 [2023-02-19 00:14:47,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:47,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:47,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,612 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 [2023-02-19 00:14:47,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,613 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) [2023-02-19 00:14:47,614 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 [2023-02-19 00:14:47,616 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 [2023-02-19 00:14:47,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:47,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:47,625 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,627 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 [2023-02-19 00:14:47,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,628 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) [2023-02-19 00:14:47,634 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 [2023-02-19 00:14:47,635 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 [2023-02-19 00:14:47,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:47,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:47,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:47,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:47,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,654 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) [2023-02-19 00:14:47,655 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 [2023-02-19 00:14:47,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 [2023-02-19 00:14:47,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:47,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:47,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:47,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:47,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,667 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) [2023-02-19 00:14:47,668 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 [2023-02-19 00:14:47,669 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 [2023-02-19 00:14:47,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:47,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:47,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:47,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:47,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,694 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) [2023-02-19 00:14:47,696 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 [2023-02-19 00:14:47,697 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 [2023-02-19 00:14:47,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:47,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:47,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:47,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,713 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 [2023-02-19 00:14:47,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,715 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) [2023-02-19 00:14:47,716 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 [2023-02-19 00:14:47,718 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 [2023-02-19 00:14:47,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:47,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:47,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:47,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:47,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,740 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) [2023-02-19 00:14:47,740 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 [2023-02-19 00:14:47,743 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 [2023-02-19 00:14:47,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:47,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:47,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:47,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:47,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,785 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) [2023-02-19 00:14:47,787 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 [2023-02-19 00:14:47,788 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 [2023-02-19 00:14:47,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:47,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:47,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:47,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:47,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:47,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:47,821 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 [2023-02-19 00:14:47,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,822 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) [2023-02-19 00:14:47,824 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 [2023-02-19 00:14:47,826 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 [2023-02-19 00:14:47,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:47,831 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2023-02-19 00:14:47,831 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-02-19 00:14:47,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:47,859 INFO L401 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2023-02-19 00:14:47,859 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-02-19 00:14:47,911 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-19 00:14:47,982 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-02-19 00:14:47,983 INFO L444 ModelExtractionUtils]: 11 out of 28 variables were initially zero. Simplification set additionally 13 variables to zero. [2023-02-19 00:14:47,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:47,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:47,984 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) [2023-02-19 00:14:48,003 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 [2023-02-19 00:14:48,004 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-19 00:14:48,019 INFO L438 nArgumentSynthesizer]: Removed 7 redundant supporting invariants from a total of 8. [2023-02-19 00:14:48,019 INFO L513 LassoAnalysis]: Proved termination. [2023-02-19 00:14:48,019 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~m) = 1*ackermann_~m Supporting invariants [1*ackermann_~m - 1 >= 0] [2023-02-19 00:14:48,024 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Exception during sending of exit command (exit): Broken pipe [2023-02-19 00:14:48,033 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 [2023-02-19 00:14:48,036 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2023-02-19 00:14:48,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:48,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-19 00:14:48,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:48,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-19 00:14:48,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-19 00:14:48,141 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 4 loop predicates [2023-02-19 00:14:48,141 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) [2023-02-19 00:14:48,180 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 [2023-02-19 00:14:48,220 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. [2023-02-19 00:14:48,220 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 [2023-02-19 00:14:48,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) [2023-02-19 00:14:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2023-02-19 00:14:48,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 12 letters. Loop has 8 letters. [2023-02-19 00:14:48,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:48,222 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-19 00:14:48,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:48,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-19 00:14:48,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:48,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-19 00:14:48,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-19 00:14:48,310 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 4 loop predicates [2023-02-19 00:14:48,310 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) [2023-02-19 00:14:48,453 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. [2023-02-19 00:14:48,454 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 [2023-02-19 00:14:48,455 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) [2023-02-19 00:14:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2023-02-19 00:14:48,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 12 letters. Loop has 8 letters. [2023-02-19 00:14:48,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:48,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 20 letters. Loop has 8 letters. [2023-02-19 00:14:48,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:48,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 12 letters. Loop has 16 letters. [2023-02-19 00:14:48,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:48,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 223 transitions. [2023-02-19 00:14:48,463 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2023-02-19 00:14:48,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 115 states and 180 transitions. [2023-02-19 00:14:48,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2023-02-19 00:14:48,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2023-02-19 00:14:48,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 180 transitions. [2023-02-19 00:14:48,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:14:48,469 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 180 transitions. [2023-02-19 00:14:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 180 transitions. [2023-02-19 00:14:48,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2023-02-19 00:14:48,477 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) [2023-02-19 00:14:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 175 transitions. [2023-02-19 00:14:48,479 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 175 transitions. [2023-02-19 00:14:48,479 INFO L428 stractBuchiCegarLoop]: Abstraction has 110 states and 175 transitions. [2023-02-19 00:14:48,479 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-19 00:14:48,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 175 transitions. [2023-02-19 00:14:48,480 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2023-02-19 00:14:48,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:14:48,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:14:48,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-19 00:14:48,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-19 00:14:48,481 INFO L748 eck$LassoCheckResult]: Stem: 1028#$Ultimate##0 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); 988#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; 985#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; 986#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 987#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 989#$Ultimate##0 ~m := #in~m;~n := #in~n; 1047#L17 assume !(0 == ~m); 1044#L20 assume !(0 == ~n); 1022#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 1030#$Ultimate##0 ~m := #in~m;~n := #in~n; 1071#L17 assume 0 == ~m;#res := 1 + ~n; 1070#ackermannFINAL assume true; 1061#ackermannEXIT >#45#return; 1008#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 1009#$Ultimate##0 [2023-02-19 00:14:48,481 INFO L750 eck$LassoCheckResult]: Loop: 1009#$Ultimate##0 ~m := #in~m;~n := #in~n; 1068#L17 assume !(0 == ~m); 1065#L20 assume !(0 == ~n); 1024#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 1009#$Ultimate##0 [2023-02-19 00:14:48,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:48,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1511844440, now seen corresponding path program 1 times [2023-02-19 00:14:48,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:48,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080900877] [2023-02-19 00:14:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:48,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:48,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-19 00:14:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:14:48,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:14:48,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080900877] [2023-02-19 00:14:48,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080900877] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:14:48,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934364987] [2023-02-19 00:14:48,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:48,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:14:48,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:48,568 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:14:48,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2023-02-19 00:14:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:48,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-19 00:14:48,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-19 00:14:48,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-19 00:14:48,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934364987] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-19 00:14:48,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-19 00:14:48,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2023-02-19 00:14:48,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083835615] [2023-02-19 00:14:48,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-19 00:14:48,608 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-19 00:14:48,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1697294, now seen corresponding path program 2 times [2023-02-19 00:14:48,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:48,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150468180] [2023-02-19 00:14:48,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:48,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:48,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:48,617 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:14:48,617 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:14:48,618 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:14:48,618 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:14:48,618 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-19 00:14:48,618 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:48,618 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:14:48,618 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:14:48,618 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration5_Loop [2023-02-19 00:14:48,618 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:14:48,618 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:14:48,619 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:48,620 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:48,621 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:48,621 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:48,622 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:48,623 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:48,623 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:48,624 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:48,628 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:14:48,628 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-19 00:14:48,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:48,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:48,629 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) [2023-02-19 00:14:48,643 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 [2023-02-19 00:14:48,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:48,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:48,659 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:48,659 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:48,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:48,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:48,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:48,674 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) [2023-02-19 00:14:48,675 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 [2023-02-19 00:14:48,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:48,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:48,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:48,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:48,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:48,687 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) [2023-02-19 00:14:48,688 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 [2023-02-19 00:14:48,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-19 00:14:48,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:48,708 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:48,708 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, 8, 11] Nus: [0, 0] [2023-02-19 00:14:48,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:48,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:48,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:48,712 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) [2023-02-19 00:14:48,712 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 [2023-02-19 00:14:48,715 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:48,715 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:48,721 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:48,721 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:48,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:48,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:48,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:48,725 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) [2023-02-19 00:14:48,725 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 [2023-02-19 00:14:48,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:48,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:48,733 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:48,733 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:48,736 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 [2023-02-19 00:14:48,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:48,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:48,737 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) [2023-02-19 00:14:48,737 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 [2023-02-19 00:14:48,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:48,739 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:48,745 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:48,745 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:48,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2023-02-19 00:14:48,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:48,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:48,749 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) [2023-02-19 00:14:48,749 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 [2023-02-19 00:14:48,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:48,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:48,759 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:48,759 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:48,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:48,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:48,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:48,762 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) [2023-02-19 00:14:48,762 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 [2023-02-19 00:14:48,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:48,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:48,774 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:48,775 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=4} Honda state: {ackermann_#in~m=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:48,777 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 [2023-02-19 00:14:48,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:48,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:48,778 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) [2023-02-19 00:14:48,779 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 [2023-02-19 00:14:48,780 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:48,780 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:48,786 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:48,787 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:48,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:48,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:14:48,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-19 00:14:48,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-19 00:14:48,798 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) [2023-02-19 00:14:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:14:48,848 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2023-02-19 00:14:48,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 111 transitions. [2023-02-19 00:14:48,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2023-02-19 00:14:48,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 76 states and 105 transitions. [2023-02-19 00:14:48,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2023-02-19 00:14:48,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2023-02-19 00:14:48,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 105 transitions. [2023-02-19 00:14:48,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:14:48,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 105 transitions. [2023-02-19 00:14:48,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 105 transitions. [2023-02-19 00:14:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-19 00:14:48,864 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) [2023-02-19 00:14:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 105 transitions. [2023-02-19 00:14:48,865 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 105 transitions. [2023-02-19 00:14:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-19 00:14:48,867 INFO L428 stractBuchiCegarLoop]: Abstraction has 76 states and 105 transitions. [2023-02-19 00:14:48,867 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-19 00:14:48,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 105 transitions. [2023-02-19 00:14:48,868 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2023-02-19 00:14:48,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:14:48,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:14:48,869 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-19 00:14:48,869 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-19 00:14:48,869 INFO L748 eck$LassoCheckResult]: Stem: 1267#$Ultimate##0 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); 1235#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; 1232#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; 1233#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 1234#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 1236#$Ultimate##0 ~m := #in~m;~n := #in~n; 1283#L17 assume !(0 == ~m); 1282#L20 assume !(0 == ~n); 1238#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 1237#$Ultimate##0 ~m := #in~m;~n := #in~n; 1240#L17 assume !(0 == ~m); 1248#L20 assume 0 == ~n; 1250#L21 call #t~ret4 := ackermann(~m - 1, 1);< 1259#$Ultimate##0 ~m := #in~m;~n := #in~n; 1293#L17 assume !(0 == ~m); 1278#L20 [2023-02-19 00:14:48,869 INFO L750 eck$LassoCheckResult]: Loop: 1278#L20 assume !(0 == ~n); 1264#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 1265#$Ultimate##0 ~m := #in~m;~n := #in~n; 1279#L17 assume !(0 == ~m); 1278#L20 [2023-02-19 00:14:48,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:48,869 INFO L85 PathProgramCache]: Analyzing trace with hash -376751137, now seen corresponding path program 2 times [2023-02-19 00:14:48,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:48,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370130342] [2023-02-19 00:14:48,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:48,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:48,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:48,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:48,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:48,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2009294, now seen corresponding path program 3 times [2023-02-19 00:14:48,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:48,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124364498] [2023-02-19 00:14:48,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:48,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:48,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:48,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:48,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2009908652, now seen corresponding path program 3 times [2023-02-19 00:14:48,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:48,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642974730] [2023-02-19 00:14:48,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:48,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:48,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:48,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:48,904 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:14:48,904 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:14:48,904 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:14:48,904 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:14:48,904 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-19 00:14:48,904 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:48,904 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:14:48,904 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:14:48,905 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration6_Loop [2023-02-19 00:14:48,905 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:14:48,905 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:14:48,905 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:48,906 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:48,906 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:48,907 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:48,907 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:48,908 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:48,909 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:14:48,910 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-19 00:14:48,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:48,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:48,910 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) [2023-02-19 00:14:48,912 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 [2023-02-19 00:14:48,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:48,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:48,934 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:48,934 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:48,937 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 [2023-02-19 00:14:48,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:48,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:48,938 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) [2023-02-19 00:14:48,939 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 [2023-02-19 00:14:48,941 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:48,941 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:48,947 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:48,947 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:48,958 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 [2023-02-19 00:14:48,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:48,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:48,959 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) [2023-02-19 00:14:48,959 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 [2023-02-19 00:14:48,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:48,962 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:48,971 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:48,971 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:48,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:48,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:48,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:48,975 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) [2023-02-19 00:14:48,975 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 [2023-02-19 00:14:48,978 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:48,978 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:48,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:48,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:48,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:48,999 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) [2023-02-19 00:14:48,999 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 [2023-02-19 00:14:49,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-19 00:14:49,002 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:49,332 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:49,332 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=-4, ackermann_#in~n=-7} Honda state: {ackermann_~n=-4, ackermann_#in~n=-7} Generalized eigenvectors: [{ackermann_~n=-1, ackermann_#in~n=6}, {ackermann_~n=0, ackermann_#in~n=-7}, {ackermann_~n=0, ackermann_#in~n=3}] Lambdas: [1, 0, 0] Nus: [1, 0] [2023-02-19 00:14:49,335 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 [2023-02-19 00:14:49,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,336 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) [2023-02-19 00:14:49,338 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 [2023-02-19 00:14:49,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:49,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:49,352 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:49,352 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-5, ackermann_~m=-5} Honda state: {ackermann_#in~m=-5, ackermann_~m=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:49,355 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 [2023-02-19 00:14:49,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,356 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) [2023-02-19 00:14:49,358 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 [2023-02-19 00:14:49,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:49,359 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:49,366 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:49,366 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:49,368 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 [2023-02-19 00:14:49,379 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:14:49,379 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:14:49,379 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:14:49,379 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:14:49,379 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-19 00:14:49,380 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,380 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:14:49,380 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:14:49,380 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration6_Lasso [2023-02-19 00:14:49,380 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:14:49,380 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:14:49,381 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,382 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,386 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,387 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,387 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,388 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,389 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,389 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,389 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,390 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,391 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,391 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,392 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,392 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,393 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,395 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,396 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,396 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,400 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,408 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,409 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:49,413 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:14:49,413 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-19 00:14:49,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,437 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) [2023-02-19 00:14:49,438 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 [2023-02-19 00:14:49,476 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 [2023-02-19 00:14:49,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,483 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2023-02-19 00:14:49,483 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-19 00:14:49,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,491 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2023-02-19 00:14:49,491 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-02-19 00:14:49,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:49,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,512 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) [2023-02-19 00:14:49,513 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 [2023-02-19 00:14:49,515 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 [2023-02-19 00:14:49,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:49,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:49,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:49,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,536 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) [2023-02-19 00:14:49,537 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 [2023-02-19 00:14:49,539 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 [2023-02-19 00:14:49,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:49,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:49,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,598 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 [2023-02-19 00:14:49,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,606 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) [2023-02-19 00:14:49,607 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 [2023-02-19 00:14:49,609 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 [2023-02-19 00:14:49,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:49,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:49,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,634 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 [2023-02-19 00:14:49,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,635 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) [2023-02-19 00:14:49,635 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 [2023-02-19 00:14:49,640 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 [2023-02-19 00:14:49,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:49,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:49,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:49,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:49,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,661 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) [2023-02-19 00:14:49,661 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 [2023-02-19 00:14:49,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-19 00:14:49,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:49,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:49,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:49,682 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:49,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,686 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) [2023-02-19 00:14:49,686 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 [2023-02-19 00:14:49,689 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 [2023-02-19 00:14:49,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:49,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:49,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:49,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:49,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,701 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) [2023-02-19 00:14:49,702 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 [2023-02-19 00:14:49,703 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 [2023-02-19 00:14:49,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:49,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:49,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:49,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,716 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) [2023-02-19 00:14:49,717 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 [2023-02-19 00:14:49,719 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 [2023-02-19 00:14:49,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:49,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:49,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:49,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,732 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) [2023-02-19 00:14:49,733 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 [2023-02-19 00:14:49,734 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 [2023-02-19 00:14:49,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:49,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:49,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:49,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,744 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 [2023-02-19 00:14:49,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,745 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) [2023-02-19 00:14:49,746 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 [2023-02-19 00:14:49,747 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 [2023-02-19 00:14:49,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:49,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:49,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:49,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,763 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 [2023-02-19 00:14:49,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,764 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) [2023-02-19 00:14:49,764 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 [2023-02-19 00:14:49,767 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 [2023-02-19 00:14:49,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:49,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:49,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:49,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,779 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 [2023-02-19 00:14:49,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,780 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-19 00:14:49,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2023-02-19 00:14:49,783 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 [2023-02-19 00:14:49,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:49,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:49,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:49,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:49,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,793 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) [2023-02-19 00:14:49,794 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 [2023-02-19 00:14:49,796 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 [2023-02-19 00:14:49,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:49,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:49,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:49,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2023-02-19 00:14:49,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,816 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) [2023-02-19 00:14:49,817 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 [2023-02-19 00:14:49,819 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 [2023-02-19 00:14:49,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:49,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:49,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:49,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,837 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 [2023-02-19 00:14:49,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,838 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) [2023-02-19 00:14:49,848 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 [2023-02-19 00:14:49,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-19 00:14:49,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:49,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:49,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,909 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 [2023-02-19 00:14:49,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,910 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) [2023-02-19 00:14:49,912 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 [2023-02-19 00:14:49,913 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 [2023-02-19 00:14:49,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:49,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:49,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:49,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,946 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) [2023-02-19 00:14:49,948 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 [2023-02-19 00:14:49,949 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 [2023-02-19 00:14:49,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:49,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:49,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:49,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:49,962 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 [2023-02-19 00:14:49,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:49,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:49,963 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) [2023-02-19 00:14:49,964 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 [2023-02-19 00:14:49,966 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 [2023-02-19 00:14:49,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:49,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:49,972 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-19 00:14:49,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:49,977 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-02-19 00:14:49,977 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-02-19 00:14:49,988 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-19 00:14:50,010 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-02-19 00:14:50,011 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-02-19 00:14:50,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:50,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:50,013 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) [2023-02-19 00:14:50,014 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 [2023-02-19 00:14:50,015 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-19 00:14:50,022 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-02-19 00:14:50,022 INFO L513 LassoAnalysis]: Proved termination. [2023-02-19 00:14:50,022 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~n) = 1*ackermann_~n Supporting invariants [1*ackermann_~n >= 0] [2023-02-19 00:14:50,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:50,029 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2023-02-19 00:14:50,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:50,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-19 00:14:50,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:50,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-19 00:14:50,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:14:50,109 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2023-02-19 00:14:50,109 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) [2023-02-19 00:14:50,123 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. [2023-02-19 00:14:50,124 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 [2023-02-19 00:14:50,125 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) [2023-02-19 00:14:50,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2023-02-19 00:14:50,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 15 letters. Loop has 4 letters. [2023-02-19 00:14:50,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:50,125 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-19 00:14:50,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:50,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-19 00:14:50,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:50,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-19 00:14:50,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:14:50,193 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 4 loop predicates [2023-02-19 00:14:50,193 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) [2023-02-19 00:14:50,208 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. [2023-02-19 00:14:50,209 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 [2023-02-19 00:14:50,209 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) [2023-02-19 00:14:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2023-02-19 00:14:50,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 15 letters. Loop has 4 letters. [2023-02-19 00:14:50,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:50,209 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-19 00:14:50,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:50,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-19 00:14:50,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:50,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-19 00:14:50,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:14:50,278 INFO L141 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 [2023-02-19 00:14:50,279 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) [2023-02-19 00:14:50,338 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. [2023-02-19 00:14:50,338 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 [2023-02-19 00:14:50,339 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) [2023-02-19 00:14:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2023-02-19 00:14:50,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 15 letters. Loop has 4 letters. [2023-02-19 00:14:50,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:50,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 19 letters. Loop has 4 letters. [2023-02-19 00:14:50,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:50,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 15 letters. Loop has 8 letters. [2023-02-19 00:14:50,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:50,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 230 transitions. [2023-02-19 00:14:50,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2023-02-19 00:14:50,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 113 states and 162 transitions. [2023-02-19 00:14:50,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2023-02-19 00:14:50,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2023-02-19 00:14:50,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 162 transitions. [2023-02-19 00:14:50,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:14:50,343 INFO L218 hiAutomatonCegarLoop]: Abstraction has 113 states and 162 transitions. [2023-02-19 00:14:50,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 162 transitions. [2023-02-19 00:14:50,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2023-02-19 00:14:50,347 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) [2023-02-19 00:14:50,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2023-02-19 00:14:50,348 INFO L240 hiAutomatonCegarLoop]: Abstraction has 108 states and 150 transitions. [2023-02-19 00:14:50,348 INFO L428 stractBuchiCegarLoop]: Abstraction has 108 states and 150 transitions. [2023-02-19 00:14:50,348 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-19 00:14:50,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 150 transitions. [2023-02-19 00:14:50,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-19 00:14:50,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:14:50,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:14:50,350 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-19 00:14:50,350 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-19 00:14:50,350 INFO L748 eck$LassoCheckResult]: Stem: 1944#$Ultimate##0 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); 1906#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; 1903#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; 1904#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 1905#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 1907#$Ultimate##0 ~m := #in~m;~n := #in~n; 1908#L17 assume !(0 == ~m); 1922#L20 assume !(0 == ~n); 1949#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 1970#$Ultimate##0 ~m := #in~m;~n := #in~n; 1989#L17 assume !(0 == ~m); 1988#L20 assume 0 == ~n; 1918#L21 call #t~ret4 := ackermann(~m - 1, 1);< 1961#$Ultimate##0 ~m := #in~m;~n := #in~n; 1987#L17 assume 0 == ~m;#res := 1 + ~n; 1985#ackermannFINAL assume true; 1976#ackermannEXIT >#43#return; 1973#L21-1 #res := #t~ret4;havoc #t~ret4; 1969#ackermannFINAL assume true; 1952#ackermannEXIT >#45#return; 1939#L23-1 [2023-02-19 00:14:50,350 INFO L750 eck$LassoCheckResult]: Loop: 1939#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 1942#$Ultimate##0 ~m := #in~m;~n := #in~n; 1974#L17 assume !(0 == ~m); 1975#L20 assume !(0 == ~n); 1938#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 1942#$Ultimate##0 ~m := #in~m;~n := #in~n; 1974#L17 assume !(0 == ~m); 1975#L20 assume 0 == ~n; 1915#L21 call #t~ret4 := ackermann(~m - 1, 1);< 1932#$Ultimate##0 ~m := #in~m;~n := #in~n; 1966#L17 assume 0 == ~m;#res := 1 + ~n; 1964#ackermannFINAL assume true; 1957#ackermannEXIT >#43#return; 1956#L21-1 #res := #t~ret4;havoc #t~ret4; 1955#ackermannFINAL assume true; 1948#ackermannEXIT >#45#return; 1939#L23-1 [2023-02-19 00:14:50,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:50,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2142297082, now seen corresponding path program 1 times [2023-02-19 00:14:50,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:50,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365825713] [2023-02-19 00:14:50,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:50,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:50,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:50,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:50,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:50,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1250092377, now seen corresponding path program 1 times [2023-02-19 00:14:50,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:50,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817978297] [2023-02-19 00:14:50,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:50,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:50,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:50,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:50,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:50,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1017421986, now seen corresponding path program 1 times [2023-02-19 00:14:50,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:50,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28678394] [2023-02-19 00:14:50,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:50,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:50,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-19 00:14:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:50,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:50,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-19 00:14:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:50,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-19 00:14:50,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:14:50,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28678394] [2023-02-19 00:14:50,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28678394] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:14:50,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439453020] [2023-02-19 00:14:50,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:50,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:14:50,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:50,489 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:14:50,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2023-02-19 00:14:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:50,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-19 00:14:50,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-19 00:14:50,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:14:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-19 00:14:50,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439453020] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:14:50,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:14:50,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2023-02-19 00:14:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121274299] [2023-02-19 00:14:50,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:14:50,631 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:14:50,632 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:14:50,632 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:14:50,632 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:14:50,632 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-19 00:14:50,632 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:50,632 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:14:50,632 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:14:50,632 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration7_Loop [2023-02-19 00:14:50,632 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:14:50,632 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:14:50,632 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:50,633 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:50,633 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:50,634 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:50,634 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:50,636 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:14:50,636 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-19 00:14:50,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:50,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:50,668 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) [2023-02-19 00:14:50,675 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 [2023-02-19 00:14:50,675 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:50,675 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:50,693 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:50,693 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:50,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2023-02-19 00:14:50,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:50,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:50,696 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) [2023-02-19 00:14:50,698 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 [2023-02-19 00:14:50,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:50,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:50,720 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:50,720 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:50,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2023-02-19 00:14:50,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:50,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:50,723 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-19 00:14:50,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2023-02-19 00:14:50,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:50,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:50,747 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:50,747 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:50,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2023-02-19 00:14:50,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:50,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:50,751 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) [2023-02-19 00:14:50,752 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 [2023-02-19 00:14:50,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:50,754 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:50,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:50,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:50,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:50,778 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) [2023-02-19 00:14:50,779 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 [2023-02-19 00:14:50,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-19 00:14:50,781 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:51,855 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-19 00:14:51,859 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 [2023-02-19 00:14:51,860 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:14:51,860 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:14:51,860 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:14:51,860 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:14:51,860 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-19 00:14:51,860 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:51,860 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:14:51,860 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:14:51,860 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration7_Loop [2023-02-19 00:14:51,860 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:14:51,860 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:14:51,861 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:51,864 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:51,864 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:51,865 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:51,867 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:51,869 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:14:51,869 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-19 00:14:51,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:51,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:51,872 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) [2023-02-19 00:14:51,874 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 [2023-02-19 00:14:51,878 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 [2023-02-19 00:14:51,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:51,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:51,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:51,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:51,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:51,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:51,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:51,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:51,901 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 [2023-02-19 00:14:51,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:51,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:51,903 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) [2023-02-19 00:14:51,904 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 [2023-02-19 00:14:51,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-19 00:14:51,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:51,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:51,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:51,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:51,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:51,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:51,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:51,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:51,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:51,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:51,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:51,932 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) [2023-02-19 00:14:51,934 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 [2023-02-19 00:14:51,935 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 [2023-02-19 00:14:51,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:51,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:51,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:51,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:51,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:51,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:51,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:51,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:51,945 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 [2023-02-19 00:14:51,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:51,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:51,946 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) [2023-02-19 00:14:51,947 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 [2023-02-19 00:14:51,948 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 [2023-02-19 00:14:51,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:51,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:51,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:51,954 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-19 00:14:51,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:51,955 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-19 00:14:51,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:51,958 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-19 00:14:51,960 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-19 00:14:51,960 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-19 00:14:51,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:51,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:51,965 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) [2023-02-19 00:14:51,966 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 [2023-02-19 00:14:51,967 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-19 00:14:51,967 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-19 00:14:51,967 INFO L513 LassoAnalysis]: Proved termination. [2023-02-19 00:14:51,967 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~m) = 1*ackermann_~m Supporting invariants [] [2023-02-19 00:14:51,970 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 [2023-02-19 00:14:51,970 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-19 00:14:51,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:51,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-19 00:14:51,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:52,038 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 [2023-02-19 00:14:52,042 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 [2023-02-19 00:14:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:52,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-19 00:14:52,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-19 00:14:52,116 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2023-02-19 00:14:52,116 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) [2023-02-19 00:14:52,173 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. [2023-02-19 00:14:52,174 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 [2023-02-19 00:14:52,174 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) [2023-02-19 00:14:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2023-02-19 00:14:52,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 20 letters. Loop has 16 letters. [2023-02-19 00:14:52,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:52,175 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-19 00:14:52,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:52,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-19 00:14:52,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:52,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-19 00:14:52,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-19 00:14:52,266 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2023-02-19 00:14:52,266 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) [2023-02-19 00:14:52,371 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. [2023-02-19 00:14:52,372 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 [2023-02-19 00:14:52,372 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) [2023-02-19 00:14:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2023-02-19 00:14:52,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 16 letters. [2023-02-19 00:14:52,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:52,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 36 letters. Loop has 16 letters. [2023-02-19 00:14:52,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:52,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 32 letters. [2023-02-19 00:14:52,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:52,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 409 transitions. [2023-02-19 00:14:52,376 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2023-02-19 00:14:52,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 222 states and 347 transitions. [2023-02-19 00:14:52,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2023-02-19 00:14:52,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2023-02-19 00:14:52,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 347 transitions. [2023-02-19 00:14:52,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:14:52,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 222 states and 347 transitions. [2023-02-19 00:14:52,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 347 transitions. [2023-02-19 00:14:52,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2023-02-19 00:14:52,386 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) [2023-02-19 00:14:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 327 transitions. [2023-02-19 00:14:52,387 INFO L240 hiAutomatonCegarLoop]: Abstraction has 209 states and 327 transitions. [2023-02-19 00:14:52,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:14:52,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-19 00:14:52,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-02-19 00:14:52,388 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) [2023-02-19 00:14:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:14:52,500 INFO L93 Difference]: Finished difference Result 232 states and 364 transitions. [2023-02-19 00:14:52,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 364 transitions. [2023-02-19 00:14:52,503 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2023-02-19 00:14:52,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 230 states and 362 transitions. [2023-02-19 00:14:52,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2023-02-19 00:14:52,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2023-02-19 00:14:52,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 362 transitions. [2023-02-19 00:14:52,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:14:52,506 INFO L218 hiAutomatonCegarLoop]: Abstraction has 230 states and 362 transitions. [2023-02-19 00:14:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 362 transitions. [2023-02-19 00:14:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2023-02-19 00:14:52,513 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) [2023-02-19 00:14:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 351 transitions. [2023-02-19 00:14:52,516 INFO L240 hiAutomatonCegarLoop]: Abstraction has 223 states and 351 transitions. [2023-02-19 00:14:52,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-19 00:14:52,529 INFO L428 stractBuchiCegarLoop]: Abstraction has 223 states and 351 transitions. [2023-02-19 00:14:52,529 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-19 00:14:52,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 223 states and 351 transitions. [2023-02-19 00:14:52,531 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2023-02-19 00:14:52,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:14:52,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:14:52,531 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-19 00:14:52,531 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-19 00:14:52,531 INFO L748 eck$LassoCheckResult]: Stem: 3556#$Ultimate##0 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); 3503#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; 3500#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; 3501#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 3502#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 3504#$Ultimate##0 ~m := #in~m;~n := #in~n; 3589#L17 assume !(0 == ~m); 3587#L20 assume !(0 == ~n); 3514#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 3583#$Ultimate##0 ~m := #in~m;~n := #in~n; 3584#L17 assume !(0 == ~m); 3601#L20 assume 0 == ~n; 3540#L21 call #t~ret4 := ackermann(~m - 1, 1);< 3599#$Ultimate##0 ~m := #in~m;~n := #in~n; 3602#L17 assume 0 == ~m;#res := 1 + ~n; 3600#ackermannFINAL assume true; 3595#ackermannEXIT >#43#return; 3594#L21-1 #res := #t~ret4;havoc #t~ret4; 3593#ackermannFINAL assume true; 3591#ackermannEXIT >#45#return; 3537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 3545#$Ultimate##0 ~m := #in~m;~n := #in~n; 3677#L17 assume !(0 == ~m); 3531#L20 assume !(0 == ~n); 3534#L23 [2023-02-19 00:14:52,531 INFO L750 eck$LassoCheckResult]: Loop: 3534#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 3645#$Ultimate##0 ~m := #in~m;~n := #in~n; 3642#L17 assume !(0 == ~m); 3643#L20 assume !(0 == ~n); 3534#L23 [2023-02-19 00:14:52,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1132004457, now seen corresponding path program 2 times [2023-02-19 00:14:52,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:52,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450325833] [2023-02-19 00:14:52,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:52,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-19 00:14:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:52,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-19 00:14:52,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:14:52,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450325833] [2023-02-19 00:14:52,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450325833] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:14:52,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264873300] [2023-02-19 00:14:52,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-19 00:14:52,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:14:52,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:52,637 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) [2023-02-19 00:14:52,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2023-02-19 00:14:52,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-19 00:14:52,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-19 00:14:52,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-19 00:14:52,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-19 00:14:52,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:14:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-19 00:14:52,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264873300] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:14:52,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:14:52,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 9 [2023-02-19 00:14:52,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818454332] [2023-02-19 00:14:52,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:14:52,758 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-19 00:14:52,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:52,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2259284, now seen corresponding path program 4 times [2023-02-19 00:14:52,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:52,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153041435] [2023-02-19 00:14:52,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:52,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:52,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:52,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:52,762 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:14:52,762 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:14:52,763 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:14:52,763 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:14:52,763 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-19 00:14:52,763 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:52,763 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:14:52,763 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:14:52,763 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration8_Loop [2023-02-19 00:14:52,763 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:14:52,763 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:14:52,763 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:52,764 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:52,764 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:52,765 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:52,765 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:52,766 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:52,767 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:14:52,768 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-19 00:14:52,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:52,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:52,781 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-19 00:14:52,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2023-02-19 00:14:52,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:52,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:52,801 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:52,801 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:52,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:52,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:52,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:52,833 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-19 00:14:52,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2023-02-19 00:14:52,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:52,837 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:52,857 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:52,857 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:52,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:52,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:52,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:52,884 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) [2023-02-19 00:14:52,905 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 [2023-02-19 00:14:52,905 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:52,905 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:52,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2023-02-19 00:14:52,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:52,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:52,921 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) [2023-02-19 00:14:52,923 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 [2023-02-19 00:14:52,924 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-19 00:14:52,924 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:53,068 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:53,069 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=-8, ackermann_#in~n=0} Honda state: {ackermann_~n=-8, ackermann_#in~n=0} Generalized eigenvectors: [{ackermann_~n=0, ackermann_#in~n=0}, {ackermann_~n=0, ackermann_#in~n=-8}, {ackermann_~n=-1, ackermann_#in~n=-1}] Lambdas: [15, 0, 1] Nus: [0, 0] [2023-02-19 00:14:53,072 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 [2023-02-19 00:14:53,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:53,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:53,073 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) [2023-02-19 00:14:53,076 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 [2023-02-19 00:14:53,077 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:53,077 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:53,084 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:53,084 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:53,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:53,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:53,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:53,088 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) [2023-02-19 00:14:53,096 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 [2023-02-19 00:14:53,099 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:53,099 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:53,106 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:53,106 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:53,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2023-02-19 00:14:53,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:53,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:53,110 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) [2023-02-19 00:14:53,111 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 [2023-02-19 00:14:53,113 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:53,113 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:53,124 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:53,124 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-6, ackermann_~m=-6} Honda state: {ackermann_#in~m=-6, ackermann_~m=-6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:53,127 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 [2023-02-19 00:14:53,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:14:53,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-19 00:14:53,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-19 00:14:53,128 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) [2023-02-19 00:14:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:14:53,180 INFO L93 Difference]: Finished difference Result 169 states and 264 transitions. [2023-02-19 00:14:53,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 264 transitions. [2023-02-19 00:14:53,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-19 00:14:53,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 161 states and 238 transitions. [2023-02-19 00:14:53,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2023-02-19 00:14:53,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2023-02-19 00:14:53,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 238 transitions. [2023-02-19 00:14:53,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:14:53,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 161 states and 238 transitions. [2023-02-19 00:14:53,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 238 transitions. [2023-02-19 00:14:53,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2023-02-19 00:14:53,188 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) [2023-02-19 00:14:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 215 transitions. [2023-02-19 00:14:53,189 INFO L240 hiAutomatonCegarLoop]: Abstraction has 155 states and 215 transitions. [2023-02-19 00:14:53,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-19 00:14:53,190 INFO L428 stractBuchiCegarLoop]: Abstraction has 155 states and 215 transitions. [2023-02-19 00:14:53,190 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-19 00:14:53,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 215 transitions. [2023-02-19 00:14:53,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-19 00:14:53,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:14:53,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:14:53,195 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 7, 7, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-02-19 00:14:53,195 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 11, 9, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2] [2023-02-19 00:14:53,195 INFO L748 eck$LassoCheckResult]: Stem: 4088#$Ultimate##0 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); 4065#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; 4063#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; 4064#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 4052#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 4066#$Ultimate##0 ~m := #in~m;~n := #in~n; 4139#L17 assume !(0 == ~m); 4135#L20 assume 0 == ~n; 4084#L21 call #t~ret4 := ackermann(~m - 1, 1);< 4085#$Ultimate##0 ~m := #in~m;~n := #in~n; 4157#L17 assume !(0 == ~m); 4156#L20 assume !(0 == ~n); 4090#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4091#$Ultimate##0 ~m := #in~m;~n := #in~n; 4165#L17 assume !(0 == ~m); 4164#L20 assume !(0 == ~n); 4054#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4070#$Ultimate##0 ~m := #in~m;~n := #in~n; 4071#L17 assume !(0 == ~m); 4133#L20 assume 0 == ~n; 4112#L21 call #t~ret4 := ackermann(~m - 1, 1);< 4119#$Ultimate##0 ~m := #in~m;~n := #in~n; 4147#L17 assume !(0 == ~m); 4145#L20 assume !(0 == ~n); 4106#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4141#$Ultimate##0 ~m := #in~m;~n := #in~n; 4167#L17 assume !(0 == ~m); 4166#L20 assume !(0 == ~n); 4059#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4163#$Ultimate##0 ~m := #in~m;~n := #in~n; 4160#L17 assume !(0 == ~m); 4133#L20 assume 0 == ~n; 4112#L21 call #t~ret4 := ackermann(~m - 1, 1);< 4120#$Ultimate##0 ~m := #in~m;~n := #in~n; 4155#L17 assume 0 == ~m;#res := 1 + ~n; 4154#ackermannFINAL assume true; 4151#ackermannEXIT >#43#return; 4152#L21-1 #res := #t~ret4;havoc #t~ret4; 4201#ackermannFINAL assume true; 4198#ackermannEXIT >#45#return; 4189#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 4082#$Ultimate##0 ~m := #in~m;~n := #in~n; 4199#L17 assume 0 == ~m;#res := 1 + ~n; 4196#ackermannFINAL assume true; 4188#ackermannEXIT >#47#return; 4180#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 4178#ackermannFINAL assume true; 4174#ackermannEXIT >#45#return; 4068#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 4067#$Ultimate##0 ~m := #in~m;~n := #in~n; 4069#L17 assume 0 == ~m;#res := 1 + ~n; 4077#ackermannFINAL assume true; 4170#ackermannEXIT >#47#return; 4107#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 4159#ackermannFINAL assume true; 4117#ackermannEXIT >#43#return; 4086#L21-1 #res := #t~ret4;havoc #t~ret4; 4049#ackermannFINAL assume true; 4062#ackermannEXIT >#45#return; 4051#L23-1 [2023-02-19 00:14:53,195 INFO L750 eck$LassoCheckResult]: Loop: 4051#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 4089#$Ultimate##0 ~m := #in~m;~n := #in~n; 4128#L17 assume !(0 == ~m); 4125#L20 assume 0 == ~n; 4074#L21 call #t~ret4 := ackermann(~m - 1, 1);< 4083#$Ultimate##0 ~m := #in~m;~n := #in~n; 4115#L17 assume !(0 == ~m); 4113#L20 assume !(0 == ~n); 4096#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4103#$Ultimate##0 ~m := #in~m;~n := #in~n; 4134#L17 assume !(0 == ~m); 4131#L20 assume !(0 == ~n); 4058#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4102#$Ultimate##0 ~m := #in~m;~n := #in~n; 4098#L17 assume !(0 == ~m); 4099#L20 assume 0 == ~n; 4074#L21 call #t~ret4 := ackermann(~m - 1, 1);< 4083#$Ultimate##0 ~m := #in~m;~n := #in~n; 4115#L17 assume !(0 == ~m); 4113#L20 assume !(0 == ~n); 4096#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4103#$Ultimate##0 ~m := #in~m;~n := #in~n; 4134#L17 assume !(0 == ~m); 4131#L20 assume !(0 == ~n); 4058#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4102#$Ultimate##0 ~m := #in~m;~n := #in~n; 4098#L17 assume !(0 == ~m); 4100#L20 assume !(0 == ~n); 4061#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4102#$Ultimate##0 ~m := #in~m;~n := #in~n; 4098#L17 assume !(0 == ~m); 4100#L20 assume !(0 == ~n); 4061#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4102#$Ultimate##0 ~m := #in~m;~n := #in~n; 4098#L17 assume !(0 == ~m); 4099#L20 assume 0 == ~n; 4074#L21 call #t~ret4 := ackermann(~m - 1, 1);< 4083#$Ultimate##0 ~m := #in~m;~n := #in~n; 4115#L17 assume 0 == ~m;#res := 1 + ~n; 4116#ackermannFINAL assume true; 4072#ackermannEXIT >#43#return; 4076#L21-1 #res := #t~ret4;havoc #t~ret4; 4203#ackermannFINAL assume true; 4121#ackermannEXIT >#45#return; 4123#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 4187#$Ultimate##0 ~m := #in~m;~n := #in~n; 4200#L17 assume 0 == ~m;#res := 1 + ~n; 4197#ackermannFINAL assume true; 4185#ackermannEXIT >#47#return; 4184#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 4194#ackermannFINAL assume true; 4192#ackermannEXIT >#45#return; 4182#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 4186#$Ultimate##0 ~m := #in~m;~n := #in~n; 4193#L17 assume 0 == ~m;#res := 1 + ~n; 4129#ackermannFINAL assume true; 4181#ackermannEXIT >#47#return; 4184#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 4194#ackermannFINAL assume true; 4192#ackermannEXIT >#45#return; 4183#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 4186#$Ultimate##0 ~m := #in~m;~n := #in~n; 4193#L17 assume 0 == ~m;#res := 1 + ~n; 4129#ackermannFINAL assume true; 4181#ackermannEXIT >#47#return; 4179#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 4176#ackermannFINAL assume true; 4175#ackermannEXIT >#45#return; 4068#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 4067#$Ultimate##0 ~m := #in~m;~n := #in~n; 4069#L17 assume 0 == ~m;#res := 1 + ~n; 4077#ackermannFINAL assume true; 4170#ackermannEXIT >#47#return; 4107#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 4159#ackermannFINAL assume true; 4117#ackermannEXIT >#43#return; 4086#L21-1 #res := #t~ret4;havoc #t~ret4; 4049#ackermannFINAL assume true; 4062#ackermannEXIT >#45#return; 4051#L23-1 [2023-02-19 00:14:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2019866079, now seen corresponding path program 1 times [2023-02-19 00:14:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:53,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222344751] [2023-02-19 00:14:53,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:53,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-19 00:14:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:14:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:14:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 22 proven. 54 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-02-19 00:14:53,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:14:53,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222344751] [2023-02-19 00:14:53,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222344751] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:14:53,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080009311] [2023-02-19 00:14:53,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:53,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:14:53,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:53,293 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:14:53,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2023-02-19 00:14:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-19 00:14:53,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 26 proven. 50 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-02-19 00:14:53,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:14:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 26 proven. 50 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-02-19 00:14:53,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080009311] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:14:53,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:14:53,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-02-19 00:14:53,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528836427] [2023-02-19 00:14:53,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:14:53,396 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-19 00:14:53,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:53,396 INFO L85 PathProgramCache]: Analyzing trace with hash -431501854, now seen corresponding path program 1 times [2023-02-19 00:14:53,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:53,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270914394] [2023-02-19 00:14:53,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:53,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-19 00:14:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:14:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:14:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:14:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:14:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,524 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 34 proven. 80 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2023-02-19 00:14:53,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:14:53,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270914394] [2023-02-19 00:14:53,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270914394] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:14:53,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195397672] [2023-02-19 00:14:53,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:53,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:14:53,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:53,525 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:14:53,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2023-02-19 00:14:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-19 00:14:53,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 34 proven. 80 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2023-02-19 00:14:53,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:14:53,622 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 34 proven. 80 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2023-02-19 00:14:53,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195397672] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:14:53,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:14:53,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2023-02-19 00:14:53,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243007603] [2023-02-19 00:14:53,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:14:53,623 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-19 00:14:53,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:14:53,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-19 00:14:53,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-02-19 00:14:53,623 INFO L87 Difference]: Start difference. First operand 155 states and 215 transitions. cyclomatic complexity: 64 Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 6 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-19 00:14:53,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:14:53,696 INFO L93 Difference]: Finished difference Result 135 states and 191 transitions. [2023-02-19 00:14:53,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 191 transitions. [2023-02-19 00:14:53,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2023-02-19 00:14:53,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 130 states and 186 transitions. [2023-02-19 00:14:53,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2023-02-19 00:14:53,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2023-02-19 00:14:53,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 186 transitions. [2023-02-19 00:14:53,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:14:53,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 130 states and 186 transitions. [2023-02-19 00:14:53,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 186 transitions. [2023-02-19 00:14:53,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2023-02-19 00:14:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 72 states have internal predecessors, (77), 21 states have call successors, (23), 15 states have call predecessors, (23), 15 states have return successors, (38), 19 states have call predecessors, (38), 19 states have call successors, (38) [2023-02-19 00:14:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2023-02-19 00:14:53,702 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 138 transitions. [2023-02-19 00:14:53,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-19 00:14:53,702 INFO L428 stractBuchiCegarLoop]: Abstraction has 107 states and 138 transitions. [2023-02-19 00:14:53,702 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-19 00:14:53,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 138 transitions. [2023-02-19 00:14:53,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2023-02-19 00:14:53,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:14:53,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:14:53,704 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-19 00:14:53,704 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 12, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3] [2023-02-19 00:14:53,704 INFO L748 eck$LassoCheckResult]: Stem: 5607#$Ultimate##0 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); 5576#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; 5573#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; 5574#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 5575#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 5577#$Ultimate##0 ~m := #in~m;~n := #in~n; 5620#L17 assume !(0 == ~m); 5619#L20 assume !(0 == ~n); 5592#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 5611#$Ultimate##0 ~m := #in~m;~n := #in~n; 5631#L17 assume !(0 == ~m); 5591#L20 assume 0 == ~n; 5593#L21 call #t~ret4 := ackermann(~m - 1, 1);< 5639#$Ultimate##0 ~m := #in~m;~n := #in~n; 5662#L17 assume !(0 == ~m); 5660#L20 assume !(0 == ~n); 5585#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 5582#$Ultimate##0 ~m := #in~m;~n := #in~n; 5584#L17 assume !(0 == ~m); 5590#L20 assume 0 == ~n; 5594#L21 call #t~ret4 := ackermann(~m - 1, 1);< 5651#$Ultimate##0 ~m := #in~m;~n := #in~n; 5653#L17 assume 0 == ~m;#res := 1 + ~n; 5652#ackermannFINAL assume true; 5634#ackermannEXIT >#43#return; 5635#L21-1 #res := #t~ret4;havoc #t~ret4; 5665#ackermannFINAL assume true; 5659#ackermannEXIT >#45#return; 5657#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 5658#$Ultimate##0 ~m := #in~m;~n := #in~n; 5664#L17 assume 0 == ~m;#res := 1 + ~n; 5663#ackermannFINAL assume true; 5656#ackermannEXIT >#47#return; 5655#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 5654#ackermannFINAL assume true; 5650#ackermannEXIT >#43#return; 5637#L21-1 #res := #t~ret4;havoc #t~ret4; 5670#ackermannFINAL assume true; 5668#ackermannEXIT >#45#return; 5600#L23-1 [2023-02-19 00:14:53,704 INFO L750 eck$LassoCheckResult]: Loop: 5600#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 5626#$Ultimate##0 ~m := #in~m;~n := #in~n; 5622#L17 assume !(0 == ~m); 5624#L20 assume !(0 == ~n); 5598#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 5626#$Ultimate##0 ~m := #in~m;~n := #in~n; 5622#L17 assume !(0 == ~m); 5624#L20 assume 0 == ~n; 5597#L21 call #t~ret4 := ackermann(~m - 1, 1);< 5602#$Ultimate##0 ~m := #in~m;~n := #in~n; 5616#L17 assume !(0 == ~m); 5615#L20 assume !(0 == ~n); 5608#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 5610#$Ultimate##0 ~m := #in~m;~n := #in~n; 5630#L17 assume !(0 == ~m); 5613#L20 assume 0 == ~n; 5609#L21 call #t~ret4 := ackermann(~m - 1, 1);< 5602#$Ultimate##0 ~m := #in~m;~n := #in~n; 5616#L17 assume !(0 == ~m); 5615#L20 assume !(0 == ~n); 5608#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 5610#$Ultimate##0 ~m := #in~m;~n := #in~n; 5630#L17 assume !(0 == ~m); 5613#L20 assume 0 == ~n; 5609#L21 call #t~ret4 := ackermann(~m - 1, 1);< 5602#$Ultimate##0 ~m := #in~m;~n := #in~n; 5616#L17 assume 0 == ~m;#res := 1 + ~n; 5617#ackermannFINAL assume true; 5632#ackermannEXIT >#43#return; 5633#L21-1 #res := #t~ret4;havoc #t~ret4; 5649#ackermannFINAL assume true; 5647#ackermannEXIT >#45#return; 5643#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 5645#$Ultimate##0 ~m := #in~m;~n := #in~n; 5667#L17 assume 0 == ~m;#res := 1 + ~n; 5666#ackermannFINAL assume true; 5642#ackermannEXIT >#47#return; 5641#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 5640#ackermannFINAL assume true; 5636#ackermannEXIT >#43#return; 5638#L21-1 #res := #t~ret4;havoc #t~ret4; 5648#ackermannFINAL assume true; 5646#ackermannEXIT >#45#return; 5571#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 5644#$Ultimate##0 ~m := #in~m;~n := #in~n; 5661#L17 assume !(0 == ~m); 5614#L20 assume 0 == ~n; 5609#L21 call #t~ret4 := ackermann(~m - 1, 1);< 5602#$Ultimate##0 ~m := #in~m;~n := #in~n; 5616#L17 assume !(0 == ~m); 5615#L20 assume !(0 == ~n); 5608#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 5610#$Ultimate##0 ~m := #in~m;~n := #in~n; 5630#L17 assume !(0 == ~m); 5613#L20 assume 0 == ~n; 5609#L21 call #t~ret4 := ackermann(~m - 1, 1);< 5602#$Ultimate##0 ~m := #in~m;~n := #in~n; 5616#L17 assume 0 == ~m;#res := 1 + ~n; 5617#ackermannFINAL assume true; 5632#ackermannEXIT >#43#return; 5633#L21-1 #res := #t~ret4;havoc #t~ret4; 5649#ackermannFINAL assume true; 5647#ackermannEXIT >#45#return; 5643#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 5645#$Ultimate##0 ~m := #in~m;~n := #in~n; 5667#L17 assume 0 == ~m;#res := 1 + ~n; 5666#ackermannFINAL assume true; 5642#ackermannEXIT >#47#return; 5641#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 5640#ackermannFINAL assume true; 5636#ackermannEXIT >#43#return; 5638#L21-1 #res := #t~ret4;havoc #t~ret4; 5648#ackermannFINAL assume true; 5646#ackermannEXIT >#47#return; 5641#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 5640#ackermannFINAL assume true; 5636#ackermannEXIT >#43#return; 5637#L21-1 #res := #t~ret4;havoc #t~ret4; 5670#ackermannFINAL assume true; 5668#ackermannEXIT >#45#return; 5600#L23-1 [2023-02-19 00:14:53,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:53,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1100790060, now seen corresponding path program 2 times [2023-02-19 00:14:53,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:53,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491312230] [2023-02-19 00:14:53,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:53,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:53,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:53,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:53,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:53,714 INFO L85 PathProgramCache]: Analyzing trace with hash -119431079, now seen corresponding path program 2 times [2023-02-19 00:14:53,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:53,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757490768] [2023-02-19 00:14:53,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:53,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-19 00:14:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:14:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:14:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:14:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 152 proven. 59 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-02-19 00:14:53,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:14:53,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757490768] [2023-02-19 00:14:53,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757490768] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:14:53,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031551188] [2023-02-19 00:14:53,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-19 00:14:53,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:14:53,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:53,961 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:14:53,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2023-02-19 00:14:54,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-19 00:14:54,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-19 00:14:54,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-19 00:14:54,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 90 proven. 84 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2023-02-19 00:14:54,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:14:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 106 proven. 73 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-02-19 00:14:54,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031551188] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:14:54,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:14:54,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 15] total 32 [2023-02-19 00:14:54,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883491475] [2023-02-19 00:14:54,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:14:54,297 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-19 00:14:54,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:14:54,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-19 00:14:54,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2023-02-19 00:14:54,298 INFO L87 Difference]: Start difference. First operand 107 states and 138 transitions. cyclomatic complexity: 34 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) [2023-02-19 00:14:54,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:14:54,833 INFO L93 Difference]: Finished difference Result 148 states and 200 transitions. [2023-02-19 00:14:54,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 200 transitions. [2023-02-19 00:14:54,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2023-02-19 00:14:54,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 147 states and 193 transitions. [2023-02-19 00:14:54,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2023-02-19 00:14:54,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2023-02-19 00:14:54,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 193 transitions. [2023-02-19 00:14:54,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:14:54,836 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 193 transitions. [2023-02-19 00:14:54,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 193 transitions. [2023-02-19 00:14:54,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 133. [2023-02-19 00:14:54,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 90 states have internal predecessors, (92), 26 states have call successors, (28), 17 states have call predecessors, (28), 20 states have return successors, (55), 25 states have call predecessors, (55), 23 states have call successors, (55) [2023-02-19 00:14:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 175 transitions. [2023-02-19 00:14:54,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 175 transitions. [2023-02-19 00:14:54,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-19 00:14:54,840 INFO L428 stractBuchiCegarLoop]: Abstraction has 133 states and 175 transitions. [2023-02-19 00:14:54,840 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-19 00:14:54,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 175 transitions. [2023-02-19 00:14:54,840 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2023-02-19 00:14:54,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:14:54,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:14:54,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-19 00:14:54,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-19 00:14:54,841 INFO L748 eck$LassoCheckResult]: Stem: 6710#$Ultimate##0 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); 6679#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; 6676#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; 6677#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 6678#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 6680#$Ultimate##0 ~m := #in~m;~n := #in~n; 6718#L17 assume !(0 == ~m); 6717#L20 assume !(0 == ~n); 6712#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 6713#$Ultimate##0 ~m := #in~m;~n := #in~n; 6725#L17 assume !(0 == ~m); 6726#L20 assume 0 == ~n; 6716#L21 call #t~ret4 := ackermann(~m - 1, 1);< 6749#$Ultimate##0 ~m := #in~m;~n := #in~n; 6784#L17 assume !(0 == ~m); 6715#L20 assume !(0 == ~n); 6700#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 6722#$Ultimate##0 ~m := #in~m;~n := #in~n; 6699#L17 assume !(0 == ~m); 6702#L20 assume 0 == ~n; 6704#L21 call #t~ret4 := ackermann(~m - 1, 1);< 6750#$Ultimate##0 ~m := #in~m;~n := #in~n; 6786#L17 assume 0 == ~m;#res := 1 + ~n; 6785#ackermannFINAL assume true; 6783#ackermannEXIT >#43#return; 6782#L21-1 #res := #t~ret4;havoc #t~ret4; 6781#ackermannFINAL assume true; 6777#ackermannEXIT >#45#return; 6763#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 6764#$Ultimate##0 ~m := #in~m;~n := #in~n; 6770#L17 assume 0 == ~m;#res := 1 + ~n; 6769#ackermannFINAL assume true; 6762#ackermannEXIT >#47#return; 6760#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 6752#ackermannFINAL assume true; 6748#ackermannEXIT >#43#return; 6747#L21-1 #res := #t~ret4;havoc #t~ret4; 6799#ackermannFINAL assume true; 6798#ackermannEXIT >#45#return; 6690#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 6742#$Ultimate##0 [2023-02-19 00:14:54,841 INFO L750 eck$LassoCheckResult]: Loop: 6742#$Ultimate##0 ~m := #in~m;~n := #in~n; 6740#L17 assume !(0 == ~m); 6736#L20 assume !(0 == ~n); 6689#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 6742#$Ultimate##0 [2023-02-19 00:14:54,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:54,841 INFO L85 PathProgramCache]: Analyzing trace with hash -235246462, now seen corresponding path program 3 times [2023-02-19 00:14:54,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:54,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464263536] [2023-02-19 00:14:54,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:54,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:54,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:54,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:54,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:54,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1697294, now seen corresponding path program 5 times [2023-02-19 00:14:54,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:54,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399462426] [2023-02-19 00:14:54,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:54,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:54,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:54,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:54,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:54,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1578641935, now seen corresponding path program 4 times [2023-02-19 00:14:54,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:54,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543911402] [2023-02-19 00:14:54,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:54,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:54,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:14:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:14:54,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:14:54,866 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:14:54,866 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:14:54,866 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:14:54,866 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:14:54,866 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-19 00:14:54,866 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:54,866 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:14:54,866 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:14:54,866 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration11_Loop [2023-02-19 00:14:54,866 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:14:54,866 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:14:54,867 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:54,867 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:54,868 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:54,868 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:54,869 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:54,869 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:54,870 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:54,870 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:54,873 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:14:54,873 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-19 00:14:54,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:54,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:54,875 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) [2023-02-19 00:14:54,876 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 [2023-02-19 00:14:54,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:54,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:54,897 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:54,898 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:54,921 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 [2023-02-19 00:14:54,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:54,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:54,922 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) [2023-02-19 00:14:54,923 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 [2023-02-19 00:14:54,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:54,925 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:54,937 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:54,937 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-1} Honda state: {ackermann_#in~m=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:54,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:54,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:54,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:54,941 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) [2023-02-19 00:14:54,942 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 [2023-02-19 00:14:54,945 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:54,945 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:54,966 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:54,966 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:54,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:54,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:54,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:54,969 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) [2023-02-19 00:14:54,970 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 [2023-02-19 00:14:54,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:54,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:54,986 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:54,986 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:54,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:54,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:54,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:54,989 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) [2023-02-19 00:14:54,991 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 [2023-02-19 00:14:54,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:54,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:55,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:55,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:55,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:55,017 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) [2023-02-19 00:14:55,018 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 [2023-02-19 00:14:55,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-19 00:14:55,020 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:55,038 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:55,038 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=-8} Honda state: {ackermann_#in~n=-8} Generalized eigenvectors: [{ackermann_#in~n=-1}, {ackermann_#in~n=0}, {ackermann_#in~n=0}] Lambdas: [1, 8, 11] Nus: [1, 0] [2023-02-19 00:14:55,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:55,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:55,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:55,042 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) [2023-02-19 00:14:55,044 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 [2023-02-19 00:14:55,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:55,045 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:55,052 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:55,052 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:55,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:55,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:55,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:55,055 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) [2023-02-19 00:14:55,057 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 [2023-02-19 00:14:55,059 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:55,059 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:55,065 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:55,065 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:55,067 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 [2023-02-19 00:14:55,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:55,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:55,069 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) [2023-02-19 00:14:55,070 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 [2023-02-19 00:14:55,071 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-19 00:14:55,071 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-19 00:14:55,090 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-19 00:14:55,090 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-19 00:14:55,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:55,109 INFO L210 LassoAnalysis]: Preferences: [2023-02-19 00:14:55,109 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-19 00:14:55,109 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-19 00:14:55,109 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-19 00:14:55,109 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-19 00:14:55,109 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:55,109 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-19 00:14:55,109 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-19 00:14:55,109 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration11_Lasso [2023-02-19 00:14:55,109 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-19 00:14:55,110 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-19 00:14:55,110 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,113 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,115 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,118 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,118 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,119 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,120 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,120 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,121 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,121 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,122 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,122 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,123 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,123 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,124 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,125 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,125 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,126 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,136 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,137 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,138 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,143 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,144 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-19 00:14:55,148 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-19 00:14:55,148 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-19 00:14:55,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:55,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:55,149 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) [2023-02-19 00:14:55,151 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 [2023-02-19 00:14:55,152 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 [2023-02-19 00:14:55,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:55,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:55,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:55,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:55,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:55,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:55,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:55,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:55,176 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 [2023-02-19 00:14:55,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:55,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:55,177 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) [2023-02-19 00:14:55,178 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 [2023-02-19 00:14:55,180 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 [2023-02-19 00:14:55,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:55,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:55,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:55,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:55,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:55,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:55,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:55,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:55,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:55,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:55,205 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) [2023-02-19 00:14:55,221 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 [2023-02-19 00:14:55,221 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 [2023-02-19 00:14:55,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:55,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:55,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:55,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:55,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:55,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:55,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:55,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:55,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:55,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:55,270 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) [2023-02-19 00:14:55,271 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 [2023-02-19 00:14:55,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 [2023-02-19 00:14:55,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:55,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:55,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:55,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:55,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-19 00:14:55,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-19 00:14:55,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:55,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:55,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:55,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:55,308 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) [2023-02-19 00:14:55,310 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 [2023-02-19 00:14:55,311 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 [2023-02-19 00:14:55,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:55,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:55,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:55,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:55,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:55,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:55,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:55,332 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:55,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:55,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:55,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:55,335 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) [2023-02-19 00:14:55,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 [2023-02-19 00:14:55,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:55,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:55,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:55,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:55,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:55,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:55,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:55,362 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 [2023-02-19 00:14:55,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:55,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:55,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:55,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:55,374 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) [2023-02-19 00:14:55,375 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 [2023-02-19 00:14:55,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 [2023-02-19 00:14:55,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:55,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:55,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:55,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:55,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:55,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:55,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:55,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:55,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:55,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:55,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:55,408 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) [2023-02-19 00:14:55,409 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 [2023-02-19 00:14:55,411 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 [2023-02-19 00:14:55,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:55,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:55,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:55,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:55,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:55,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:55,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:55,432 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:55,434 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 [2023-02-19 00:14:55,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:55,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:55,435 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) [2023-02-19 00:14:55,437 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 [2023-02-19 00:14:55,438 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 [2023-02-19 00:14:55,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:55,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-19 00:14:55,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:55,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-19 00:14:55,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:55,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-19 00:14:55,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-19 00:14:55,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-19 00:14:55,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:55,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:55,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:55,450 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) [2023-02-19 00:14:55,451 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 [2023-02-19 00:14:55,453 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 [2023-02-19 00:14:55,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-19 00:14:55,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-19 00:14:55,458 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-19 00:14:55,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-19 00:14:55,461 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-02-19 00:14:55,461 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-02-19 00:14:55,478 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-19 00:14:55,486 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-02-19 00:14:55,486 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-02-19 00:14:55,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-19 00:14:55,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:55,488 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) [2023-02-19 00:14:55,501 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-19 00:14:55,509 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 [2023-02-19 00:14:55,515 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-02-19 00:14:55,515 INFO L513 LassoAnalysis]: Proved termination. [2023-02-19 00:14:55,515 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~n) = 1*ackermann_#in~n Supporting invariants [1*ackermann_#in~n >= 0] [2023-02-19 00:14:55,518 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 [2023-02-19 00:14:55,520 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2023-02-19 00:14:55,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:55,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-19 00:14:55,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:55,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-19 00:14:55,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:14:55,692 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 3 loop predicates [2023-02-19 00:14:55,692 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 175 transitions. cyclomatic complexity: 46 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) [2023-02-19 00:14:55,863 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 175 transitions. cyclomatic complexity: 46. 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 137 states and 184 transitions. Complement of second has 13 states. [2023-02-19 00:14:55,864 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 [2023-02-19 00:14:55,864 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) [2023-02-19 00:14:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2023-02-19 00:14:55,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 21 transitions. Stem has 40 letters. Loop has 4 letters. [2023-02-19 00:14:55,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:55,864 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-19 00:14:55,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:55,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-19 00:14:55,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:56,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2023-02-19 00:14:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:56,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-19 00:14:56,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:56,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:14:56,080 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 3 loop predicates [2023-02-19 00:14:56,081 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 175 transitions. cyclomatic complexity: 46 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) [2023-02-19 00:14:56,282 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 175 transitions. cyclomatic complexity: 46. 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 137 states and 184 transitions. Complement of second has 13 states. [2023-02-19 00:14:56,282 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 [2023-02-19 00:14:56,283 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) [2023-02-19 00:14:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2023-02-19 00:14:56,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 21 transitions. Stem has 40 letters. Loop has 4 letters. [2023-02-19 00:14:56,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:56,283 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-19 00:14:56,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:56,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-19 00:14:56,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:56,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-19 00:14:56,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-19 00:14:56,486 INFO L141 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 [2023-02-19 00:14:56,486 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 175 transitions. cyclomatic complexity: 46 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) [2023-02-19 00:14:56,802 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 175 transitions. cyclomatic complexity: 46. 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 218 states and 282 transitions. Complement of second has 42 states. [2023-02-19 00:14:56,803 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 [2023-02-19 00:14:56,804 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) [2023-02-19 00:14:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 37 transitions. [2023-02-19 00:14:56,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 40 letters. Loop has 4 letters. [2023-02-19 00:14:56,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:56,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 44 letters. Loop has 4 letters. [2023-02-19 00:14:56,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:56,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 40 letters. Loop has 8 letters. [2023-02-19 00:14:56,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-19 00:14:56,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 282 transitions. [2023-02-19 00:14:56,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2023-02-19 00:14:56,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 174 states and 228 transitions. [2023-02-19 00:14:56,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2023-02-19 00:14:56,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2023-02-19 00:14:56,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 228 transitions. [2023-02-19 00:14:56,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:14:56,808 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 228 transitions. [2023-02-19 00:14:56,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 228 transitions. [2023-02-19 00:14:56,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 152. [2023-02-19 00:14:56,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 100 states have (on average 1.06) internal successors, (106), 101 states have internal predecessors, (106), 33 states have call successors, (36), 19 states have call predecessors, (36), 19 states have return successors, (49), 31 states have call predecessors, (49), 29 states have call successors, (49) [2023-02-19 00:14:56,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 191 transitions. [2023-02-19 00:14:56,820 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 191 transitions. [2023-02-19 00:14:56,821 INFO L428 stractBuchiCegarLoop]: Abstraction has 152 states and 191 transitions. [2023-02-19 00:14:56,821 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-19 00:14:56,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 191 transitions. [2023-02-19 00:14:56,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2023-02-19 00:14:56,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:14:56,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:14:56,823 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 11, 9, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2023-02-19 00:14:56,823 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 11, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3] [2023-02-19 00:14:56,823 INFO L748 eck$LassoCheckResult]: Stem: 7923#$Ultimate##0 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); 7889#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; 7886#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; 7887#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 7888#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 7890#$Ultimate##0 ~m := #in~m;~n := #in~n; 7952#L17 assume !(0 == ~m); 7950#L20 assume !(0 == ~n); 7945#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7948#$Ultimate##0 ~m := #in~m;~n := #in~n; 7951#L17 assume !(0 == ~m); 7949#L20 assume !(0 == ~n); 7944#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7943#$Ultimate##0 ~m := #in~m;~n := #in~n; 7946#L17 assume !(0 == ~m); 7971#L20 assume 0 == ~n; 7940#L21 call #t~ret4 := ackermann(~m - 1, 1);< 7947#$Ultimate##0 ~m := #in~m;~n := #in~n; 7942#L17 assume !(0 == ~m); 7939#L20 assume !(0 == ~n); 7930#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7936#$Ultimate##0 ~m := #in~m;~n := #in~n; 7934#L17 assume !(0 == ~m); 7929#L20 assume 0 == ~n; 7932#L21 call #t~ret4 := ackermann(~m - 1, 1);< 7947#$Ultimate##0 ~m := #in~m;~n := #in~n; 7942#L17 assume !(0 == ~m); 7939#L20 assume !(0 == ~n); 7930#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7936#$Ultimate##0 ~m := #in~m;~n := #in~n; 7934#L17 assume !(0 == ~m); 7929#L20 assume 0 == ~n; 7932#L21 call #t~ret4 := ackermann(~m - 1, 1);< 7970#$Ultimate##0 ~m := #in~m;~n := #in~n; 7999#L17 assume 0 == ~m;#res := 1 + ~n; 7998#ackermannFINAL assume true; 7997#ackermannEXIT >#43#return; 7996#L21-1 #res := #t~ret4;havoc #t~ret4; 7995#ackermannFINAL assume true; 7994#ackermannEXIT >#45#return; 7979#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 7980#$Ultimate##0 ~m := #in~m;~n := #in~n; 7982#L17 assume 0 == ~m;#res := 1 + ~n; 7981#ackermannFINAL assume true; 7978#ackermannEXIT >#47#return; 7976#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 7974#ackermannFINAL assume true; 7969#ackermannEXIT >#43#return; 7966#L21-1 #res := #t~ret4;havoc #t~ret4; 7963#ackermannFINAL assume true; 7961#ackermannEXIT >#45#return; 7957#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 7958#$Ultimate##0 ~m := #in~m;~n := #in~n; 8029#L17 assume !(0 == ~m); 8028#L20 assume !(0 == ~n); 7883#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7937#$Ultimate##0 ~m := #in~m;~n := #in~n; 7935#L17 assume !(0 == ~m); 7933#L20 assume 0 == ~n; 7913#L21 call #t~ret4 := ackermann(~m - 1, 1);< 7914#$Ultimate##0 ~m := #in~m;~n := #in~n; 7993#L17 assume 0 == ~m;#res := 1 + ~n; 7926#ackermannFINAL assume true; 7992#ackermannEXIT >#43#return; 7917#L21-1 #res := #t~ret4;havoc #t~ret4; 7878#ackermannFINAL assume true; 7885#ackermannEXIT >#45#return; 7892#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 7891#$Ultimate##0 ~m := #in~m;~n := #in~n; 7895#L17 assume 0 == ~m;#res := 1 + ~n; 7906#ackermannFINAL assume true; 8027#ackermannEXIT >#47#return; 8020#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 8018#ackermannFINAL assume true; 8016#ackermannEXIT >#47#return; 8015#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 8014#ackermannFINAL assume true; 8012#ackermannEXIT >#43#return; 8013#L21-1 #res := #t~ret4;havoc #t~ret4; 8026#ackermannFINAL assume true; 8007#ackermannEXIT >#45#return; 7903#L23-1 [2023-02-19 00:14:56,824 INFO L750 eck$LassoCheckResult]: Loop: 7903#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 7960#$Ultimate##0 ~m := #in~m;~n := #in~n; 8024#L17 assume !(0 == ~m); 8023#L20 assume !(0 == ~n); 7880#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7896#$Ultimate##0 ~m := #in~m;~n := #in~n; 7897#L17 assume !(0 == ~m); 8006#L20 assume !(0 == ~n); 7884#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7896#$Ultimate##0 ~m := #in~m;~n := #in~n; 7898#L17 assume !(0 == ~m); 7973#L20 assume 0 == ~n; 7920#L21 call #t~ret4 := ackermann(~m - 1, 1);< 7927#$Ultimate##0 ~m := #in~m;~n := #in~n; 7925#L17 assume !(0 == ~m); 7924#L20 assume !(0 == ~n); 7919#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7922#$Ultimate##0 ~m := #in~m;~n := #in~n; 7977#L17 assume !(0 == ~m); 7975#L20 assume 0 == ~n; 7921#L21 call #t~ret4 := ackermann(~m - 1, 1);< 7927#$Ultimate##0 ~m := #in~m;~n := #in~n; 7925#L17 assume !(0 == ~m); 7924#L20 assume !(0 == ~n); 7919#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7922#$Ultimate##0 ~m := #in~m;~n := #in~n; 7977#L17 assume !(0 == ~m); 7975#L20 assume 0 == ~n; 7921#L21 call #t~ret4 := ackermann(~m - 1, 1);< 7927#$Ultimate##0 ~m := #in~m;~n := #in~n; 7925#L17 assume 0 == ~m;#res := 1 + ~n; 7926#ackermannFINAL assume true; 7992#ackermannEXIT >#43#return; 7991#L21-1 #res := #t~ret4;havoc #t~ret4; 7990#ackermannFINAL assume true; 7988#ackermannEXIT >#45#return; 7985#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 7986#$Ultimate##0 ~m := #in~m;~n := #in~n; 7989#L17 assume 0 == ~m;#res := 1 + ~n; 7987#ackermannFINAL assume true; 7984#ackermannEXIT >#47#return; 7983#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 7972#ackermannFINAL assume true; 7967#ackermannEXIT >#43#return; 7966#L21-1 #res := #t~ret4;havoc #t~ret4; 7963#ackermannFINAL assume true; 7961#ackermannEXIT >#45#return; 7957#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 7958#$Ultimate##0 ~m := #in~m;~n := #in~n; 8029#L17 assume !(0 == ~m); 8028#L20 assume !(0 == ~n); 7883#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7937#$Ultimate##0 ~m := #in~m;~n := #in~n; 7935#L17 assume !(0 == ~m); 7933#L20 assume 0 == ~n; 7913#L21 call #t~ret4 := ackermann(~m - 1, 1);< 7914#$Ultimate##0 ~m := #in~m;~n := #in~n; 7993#L17 assume 0 == ~m;#res := 1 + ~n; 7926#ackermannFINAL assume true; 7992#ackermannEXIT >#43#return; 7917#L21-1 #res := #t~ret4;havoc #t~ret4; 7878#ackermannFINAL assume true; 7885#ackermannEXIT >#45#return; 7892#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 7891#$Ultimate##0 ~m := #in~m;~n := #in~n; 7895#L17 assume 0 == ~m;#res := 1 + ~n; 7906#ackermannFINAL assume true; 8027#ackermannEXIT >#47#return; 8020#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 8018#ackermannFINAL assume true; 8016#ackermannEXIT >#47#return; 8015#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 8014#ackermannFINAL assume true; 8012#ackermannEXIT >#43#return; 8013#L21-1 #res := #t~ret4;havoc #t~ret4; 8026#ackermannFINAL assume true; 8007#ackermannEXIT >#45#return; 7903#L23-1 [2023-02-19 00:14:56,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1984234175, now seen corresponding path program 5 times [2023-02-19 00:14:56,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:56,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217305152] [2023-02-19 00:14:56,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:56,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:56,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-19 00:14:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:56,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:14:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:14:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:14:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 115 proven. 61 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-02-19 00:14:57,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:14:57,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217305152] [2023-02-19 00:14:57,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217305152] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:14:57,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231772873] [2023-02-19 00:14:57,121 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-19 00:14:57,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:14:57,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:57,133 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) [2023-02-19 00:14:57,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2023-02-19 00:14:57,199 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-02-19 00:14:57,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-19 00:14:57,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-19 00:14:57,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 102 proven. 69 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-02-19 00:14:57,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:14:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 59 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-02-19 00:14:57,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231772873] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:14:57,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:14:57,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 16] total 26 [2023-02-19 00:14:57,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983088036] [2023-02-19 00:14:57,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:14:57,472 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-19 00:14:57,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:57,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1263997516, now seen corresponding path program 3 times [2023-02-19 00:14:57,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:57,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143711970] [2023-02-19 00:14:57,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:57,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-19 00:14:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:14:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:14:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:14:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 118 proven. 61 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-02-19 00:14:57,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:14:57,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143711970] [2023-02-19 00:14:57,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143711970] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:14:57,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254050306] [2023-02-19 00:14:57,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-19 00:14:57,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:14:57,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:57,773 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) [2023-02-19 00:14:57,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2023-02-19 00:14:57,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-02-19 00:14:57,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-19 00:14:57,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-19 00:14:57,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 105 proven. 69 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-02-19 00:14:57,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:14:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 123 proven. 59 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-02-19 00:14:58,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254050306] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:14:58,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:14:58,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 16] total 26 [2023-02-19 00:14:58,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348067806] [2023-02-19 00:14:58,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:14:58,131 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-19 00:14:58,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:14:58,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-19 00:14:58,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2023-02-19 00:14:58,132 INFO L87 Difference]: Start difference. First operand 152 states and 191 transitions. cyclomatic complexity: 43 Second operand has 26 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 18 states have internal predecessors, (48), 10 states have call successors, (12), 1 states have call predecessors, (12), 12 states have return successors, (20), 12 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-19 00:14:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:14:58,407 INFO L93 Difference]: Finished difference Result 189 states and 258 transitions. [2023-02-19 00:14:58,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 258 transitions. [2023-02-19 00:14:58,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2023-02-19 00:14:58,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 173 states and 232 transitions. [2023-02-19 00:14:58,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2023-02-19 00:14:58,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2023-02-19 00:14:58,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 232 transitions. [2023-02-19 00:14:58,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:14:58,410 INFO L218 hiAutomatonCegarLoop]: Abstraction has 173 states and 232 transitions. [2023-02-19 00:14:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 232 transitions. [2023-02-19 00:14:58,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2023-02-19 00:14:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 103 states have (on average 1.058252427184466) internal successors, (109), 107 states have internal predecessors, (109), 33 states have call successors, (36), 19 states have call predecessors, (36), 22 states have return successors, (57), 31 states have call predecessors, (57), 29 states have call successors, (57) [2023-02-19 00:14:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 202 transitions. [2023-02-19 00:14:58,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 158 states and 202 transitions. [2023-02-19 00:14:58,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-19 00:14:58,415 INFO L428 stractBuchiCegarLoop]: Abstraction has 158 states and 202 transitions. [2023-02-19 00:14:58,415 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-19 00:14:58,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 202 transitions. [2023-02-19 00:14:58,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2023-02-19 00:14:58,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:14:58,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:14:58,417 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 13, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2023-02-19 00:14:58,417 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 13, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4] [2023-02-19 00:14:58,417 INFO L748 eck$LassoCheckResult]: Stem: 9773#$Ultimate##0 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); 9744#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; 9741#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; 9742#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 9743#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 9745#$Ultimate##0 ~m := #in~m;~n := #in~n; 9809#L17 assume !(0 == ~m); 9807#L20 assume !(0 == ~n); 9737#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9799#$Ultimate##0 ~m := #in~m;~n := #in~n; 9800#L17 assume !(0 == ~m); 9788#L20 assume 0 == ~n; 9789#L21 call #t~ret4 := ackermann(~m - 1, 1);< 9804#$Ultimate##0 ~m := #in~m;~n := #in~n; 9805#L17 assume !(0 == ~m); 9798#L20 assume !(0 == ~n); 9786#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9793#$Ultimate##0 ~m := #in~m;~n := #in~n; 9791#L17 assume !(0 == ~m); 9784#L20 assume 0 == ~n; 9787#L21 call #t~ret4 := ackermann(~m - 1, 1);< 9804#$Ultimate##0 ~m := #in~m;~n := #in~n; 9805#L17 assume !(0 == ~m); 9798#L20 assume !(0 == ~n); 9786#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9793#$Ultimate##0 ~m := #in~m;~n := #in~n; 9791#L17 assume !(0 == ~m); 9784#L20 assume 0 == ~n; 9787#L21 call #t~ret4 := ackermann(~m - 1, 1);< 9826#$Ultimate##0 ~m := #in~m;~n := #in~n; 9852#L17 assume 0 == ~m;#res := 1 + ~n; 9851#ackermannFINAL assume true; 9848#ackermannEXIT >#43#return; 9847#L21-1 #res := #t~ret4;havoc #t~ret4; 9846#ackermannFINAL assume true; 9845#ackermannEXIT >#45#return; 9843#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9844#$Ultimate##0 ~m := #in~m;~n := #in~n; 9850#L17 assume 0 == ~m;#res := 1 + ~n; 9849#ackermannFINAL assume true; 9842#ackermannEXIT >#47#return; 9839#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 9836#ackermannFINAL assume true; 9825#ackermannEXIT >#43#return; 9822#L21-1 #res := #t~ret4;havoc #t~ret4; 9821#ackermannFINAL assume true; 9818#ackermannEXIT >#45#return; 9811#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9813#$Ultimate##0 ~m := #in~m;~n := #in~n; 9812#L17 assume !(0 == ~m); 9810#L20 assume !(0 == ~n); 9759#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9794#$Ultimate##0 ~m := #in~m;~n := #in~n; 9795#L17 assume !(0 == ~m); 9888#L20 assume !(0 == ~n); 9757#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9794#$Ultimate##0 ~m := #in~m;~n := #in~n; 9792#L17 assume !(0 == ~m); 9790#L20 assume 0 == ~n; 9766#L21 call #t~ret4 := ackermann(~m - 1, 1);< 9767#$Ultimate##0 ~m := #in~m;~n := #in~n; 9853#L17 assume 0 == ~m;#res := 1 + ~n; 9780#ackermannFINAL assume true; 9841#ackermannEXIT >#43#return; 9771#L21-1 #res := #t~ret4;havoc #t~ret4; 9772#ackermannFINAL assume true; 9889#ackermannEXIT >#45#return; 9747#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9746#$Ultimate##0 ~m := #in~m;~n := #in~n; 9750#L17 assume 0 == ~m;#res := 1 + ~n; 9760#ackermannFINAL assume true; 9866#ackermannEXIT >#47#return; 9867#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 9891#ackermannFINAL assume true; 9869#ackermannEXIT >#45#return; 9748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9746#$Ultimate##0 ~m := #in~m;~n := #in~n; 9750#L17 assume 0 == ~m;#res := 1 + ~n; 9760#ackermannFINAL assume true; 9866#ackermannEXIT >#47#return; 9868#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 9883#ackermannFINAL assume true; 9881#ackermannEXIT >#47#return; 9880#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 9879#ackermannFINAL assume true; 9877#ackermannEXIT >#43#return; 9878#L21-1 #res := #t~ret4;havoc #t~ret4; 9890#ackermannFINAL assume true; 9754#ackermannEXIT >#45#return; 9756#L23-1 [2023-02-19 00:14:58,418 INFO L750 eck$LassoCheckResult]: Loop: 9756#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9816#$Ultimate##0 ~m := #in~m;~n := #in~n; 9873#L17 assume !(0 == ~m); 9871#L20 assume !(0 == ~n); 9739#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9751#$Ultimate##0 ~m := #in~m;~n := #in~n; 9753#L17 assume !(0 == ~m); 9764#L20 assume 0 == ~n; 9765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 9781#$Ultimate##0 ~m := #in~m;~n := #in~n; 9779#L17 assume !(0 == ~m); 9778#L20 assume !(0 == ~n); 9774#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9777#$Ultimate##0 ~m := #in~m;~n := #in~n; 9817#L17 assume !(0 == ~m); 9827#L20 assume 0 == ~n; 9776#L21 call #t~ret4 := ackermann(~m - 1, 1);< 9781#$Ultimate##0 ~m := #in~m;~n := #in~n; 9779#L17 assume !(0 == ~m); 9778#L20 assume !(0 == ~n); 9774#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9777#$Ultimate##0 ~m := #in~m;~n := #in~n; 9817#L17 assume !(0 == ~m); 9827#L20 assume 0 == ~n; 9776#L21 call #t~ret4 := ackermann(~m - 1, 1);< 9781#$Ultimate##0 ~m := #in~m;~n := #in~n; 9779#L17 assume 0 == ~m;#res := 1 + ~n; 9780#ackermannFINAL assume true; 9841#ackermannEXIT >#43#return; 9838#L21-1 #res := #t~ret4;havoc #t~ret4; 9835#ackermannFINAL assume true; 9834#ackermannEXIT >#45#return; 9832#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9833#$Ultimate##0 ~m := #in~m;~n := #in~n; 9840#L17 assume 0 == ~m;#res := 1 + ~n; 9837#ackermannFINAL assume true; 9831#ackermannEXIT >#47#return; 9829#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 9828#ackermannFINAL assume true; 9823#ackermannEXIT >#43#return; 9822#L21-1 #res := #t~ret4;havoc #t~ret4; 9821#ackermannFINAL assume true; 9818#ackermannEXIT >#45#return; 9811#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9813#$Ultimate##0 ~m := #in~m;~n := #in~n; 9812#L17 assume !(0 == ~m); 9810#L20 assume !(0 == ~n); 9759#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9794#$Ultimate##0 ~m := #in~m;~n := #in~n; 9795#L17 assume !(0 == ~m); 9888#L20 assume !(0 == ~n); 9757#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9794#$Ultimate##0 ~m := #in~m;~n := #in~n; 9792#L17 assume !(0 == ~m); 9790#L20 assume 0 == ~n; 9766#L21 call #t~ret4 := ackermann(~m - 1, 1);< 9767#$Ultimate##0 ~m := #in~m;~n := #in~n; 9853#L17 assume 0 == ~m;#res := 1 + ~n; 9780#ackermannFINAL assume true; 9841#ackermannEXIT >#43#return; 9771#L21-1 #res := #t~ret4;havoc #t~ret4; 9772#ackermannFINAL assume true; 9889#ackermannEXIT >#45#return; 9747#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9746#$Ultimate##0 ~m := #in~m;~n := #in~n; 9750#L17 assume 0 == ~m;#res := 1 + ~n; 9760#ackermannFINAL assume true; 9866#ackermannEXIT >#47#return; 9867#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 9891#ackermannFINAL assume true; 9869#ackermannEXIT >#45#return; 9748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9746#$Ultimate##0 ~m := #in~m;~n := #in~n; 9750#L17 assume 0 == ~m;#res := 1 + ~n; 9760#ackermannFINAL assume true; 9866#ackermannEXIT >#47#return; 9868#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 9883#ackermannFINAL assume true; 9881#ackermannEXIT >#47#return; 9880#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 9879#ackermannFINAL assume true; 9877#ackermannEXIT >#43#return; 9878#L21-1 #res := #t~ret4;havoc #t~ret4; 9890#ackermannFINAL assume true; 9754#ackermannEXIT >#45#return; 9756#L23-1 [2023-02-19 00:14:58,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:58,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2095171192, now seen corresponding path program 6 times [2023-02-19 00:14:58,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:58,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339417237] [2023-02-19 00:14:58,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:58,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:58,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-19 00:14:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:58,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:58,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:58,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:58,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:58,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:58,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:14:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:58,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:14:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:58,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:58,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:58,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:58,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:14:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:58,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:14:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:58,753 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 139 proven. 101 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-02-19 00:14:58,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:14:58,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339417237] [2023-02-19 00:14:58,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339417237] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:14:58,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766857611] [2023-02-19 00:14:58,753 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-19 00:14:58,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:14:58,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:58,771 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:14:58,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Waiting until timeout for monitored process [2023-02-19 00:14:58,894 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2023-02-19 00:14:58,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-19 00:14:58,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-19 00:14:58,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 125 proven. 109 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2023-02-19 00:14:58,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:14:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 141 proven. 107 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2023-02-19 00:14:59,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766857611] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:14:59,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:14:59,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 23 [2023-02-19 00:14:59,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054669348] [2023-02-19 00:14:59,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:14:59,149 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-19 00:14:59,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:14:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash -869926651, now seen corresponding path program 4 times [2023-02-19 00:14:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:14:59,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134267311] [2023-02-19 00:14:59,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:14:59,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:14:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:59,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-19 00:14:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:59,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:59,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:59,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:59,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:59,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:59,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:14:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:59,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:14:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:59,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:59,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:59,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:14:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:59,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:14:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:59,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:14:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:14:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 143 proven. 101 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-02-19 00:14:59,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:14:59,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134267311] [2023-02-19 00:14:59,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134267311] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:14:59,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776173611] [2023-02-19 00:14:59,438 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-19 00:14:59,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:14:59,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:14:59,477 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:14:59,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2023-02-19 00:14:59,604 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-19 00:14:59,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-19 00:14:59,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-19 00:14:59,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:14:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 129 proven. 109 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2023-02-19 00:14:59,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:14:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 145 proven. 107 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2023-02-19 00:14:59,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776173611] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:14:59,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:14:59,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 23 [2023-02-19 00:14:59,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059496219] [2023-02-19 00:14:59,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:14:59,814 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-19 00:14:59,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:14:59,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-19 00:14:59,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2023-02-19 00:14:59,814 INFO L87 Difference]: Start difference. First operand 158 states and 202 transitions. cyclomatic complexity: 48 Second operand has 23 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 12 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) [2023-02-19 00:15:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:15:00,093 INFO L93 Difference]: Finished difference Result 202 states and 280 transitions. [2023-02-19 00:15:00,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 280 transitions. [2023-02-19 00:15:00,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2023-02-19 00:15:00,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 186 states and 254 transitions. [2023-02-19 00:15:00,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2023-02-19 00:15:00,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2023-02-19 00:15:00,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 254 transitions. [2023-02-19 00:15:00,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:15:00,097 INFO L218 hiAutomatonCegarLoop]: Abstraction has 186 states and 254 transitions. [2023-02-19 00:15:00,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 254 transitions. [2023-02-19 00:15:00,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2023-02-19 00:15:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 109 states have (on average 1.055045871559633) internal successors, (115), 113 states have internal predecessors, (115), 36 states have call successors, (39), 19 states have call predecessors, (39), 25 states have return successors, (69), 37 states have call predecessors, (69), 32 states have call successors, (69) [2023-02-19 00:15:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 223 transitions. [2023-02-19 00:15:00,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 170 states and 223 transitions. [2023-02-19 00:15:00,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-19 00:15:00,103 INFO L428 stractBuchiCegarLoop]: Abstraction has 170 states and 223 transitions. [2023-02-19 00:15:00,103 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-02-19 00:15:00,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 223 transitions. [2023-02-19 00:15:00,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2023-02-19 00:15:00,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:15:00,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:15:00,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 15, 10, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2023-02-19 00:15:00,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [59, 58, 35, 24, 24, 24, 24, 24, 23, 23, 11, 11, 11, 11] [2023-02-19 00:15:00,110 INFO L748 eck$LassoCheckResult]: Stem: 11872#$Ultimate##0 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); 11843#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; 11840#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; 11841#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 11842#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 11844#$Ultimate##0 ~m := #in~m;~n := #in~n; 11910#L17 assume !(0 == ~m); 11908#L20 assume !(0 == ~n); 11888#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11900#$Ultimate##0 ~m := #in~m;~n := #in~n; 11901#L17 assume !(0 == ~m); 11887#L20 assume 0 == ~n; 11890#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11905#$Ultimate##0 ~m := #in~m;~n := #in~n; 11906#L17 assume !(0 == ~m); 11899#L20 assume !(0 == ~n); 11885#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11894#$Ultimate##0 ~m := #in~m;~n := #in~n; 11892#L17 assume !(0 == ~m); 11883#L20 assume 0 == ~n; 11886#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11905#$Ultimate##0 ~m := #in~m;~n := #in~n; 11906#L17 assume !(0 == ~m); 11899#L20 assume !(0 == ~n); 11885#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11894#$Ultimate##0 ~m := #in~m;~n := #in~n; 11892#L17 assume !(0 == ~m); 11883#L20 assume 0 == ~n; 11886#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11923#$Ultimate##0 ~m := #in~m;~n := #in~n; 11952#L17 assume 0 == ~m;#res := 1 + ~n; 11951#ackermannFINAL assume true; 11949#ackermannEXIT >#43#return; 11947#L21-1 #res := #t~ret4;havoc #t~ret4; 11945#ackermannFINAL assume true; 11941#ackermannEXIT >#45#return; 11846#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11845#$Ultimate##0 ~m := #in~m;~n := #in~n; 11847#L17 assume 0 == ~m;#res := 1 + ~n; 11954#ackermannFINAL assume true; 11937#ackermannEXIT >#47#return; 11935#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11933#ackermannFINAL assume true; 11929#ackermannEXIT >#43#return; 11928#L21-1 #res := #t~ret4;havoc #t~ret4; 11927#ackermannFINAL assume true; 11924#ackermannEXIT >#45#return; 11925#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11964#$Ultimate##0 ~m := #in~m;~n := #in~n; 11984#L17 assume !(0 == ~m); 11982#L20 assume !(0 == ~n); 11837#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11893#L17 assume !(0 == ~m); 11891#L20 assume 0 == ~n; 11861#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11862#$Ultimate##0 ~m := #in~m;~n := #in~n; 11953#L17 assume 0 == ~m;#res := 1 + ~n; 11875#ackermannFINAL assume true; 11950#ackermannEXIT >#43#return; 11866#L21-1 #res := #t~ret4;havoc #t~ret4; 11867#ackermannFINAL assume true; 11998#ackermannEXIT >#45#return; 11853#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11865#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11832#ackermannFINAL assume true; 11839#ackermannEXIT >#45#return; 11851#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11994#ackermannFINAL assume true; 11980#ackermannEXIT >#45#return; 11854#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11968#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11966#ackermannFINAL assume true; 11962#ackermannEXIT >#47#return; 11960#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11959#ackermannFINAL assume true; 11956#ackermannEXIT >#43#return; 11958#L21-1 #res := #t~ret4;havoc #t~ret4; 12000#ackermannFINAL assume true; 11997#ackermannEXIT >#45#return; 11877#L23-1 [2023-02-19 00:15:00,110 INFO L750 eck$LassoCheckResult]: Loop: 11877#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11921#$Ultimate##0 ~m := #in~m;~n := #in~n; 11922#L17 assume !(0 == ~m); 11990#L20 assume !(0 == ~n); 11838#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11848#$Ultimate##0 ~m := #in~m;~n := #in~n; 11849#L17 assume !(0 == ~m); 11857#L20 assume !(0 == ~n); 11834#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11848#$Ultimate##0 ~m := #in~m;~n := #in~n; 11850#L17 assume !(0 == ~m); 11858#L20 assume 0 == ~n; 11859#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11876#$Ultimate##0 ~m := #in~m;~n := #in~n; 11874#L17 assume !(0 == ~m); 11873#L20 assume !(0 == ~n); 11868#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11871#$Ultimate##0 ~m := #in~m;~n := #in~n; 11914#L17 assume !(0 == ~m); 11932#L20 assume 0 == ~n; 11870#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11876#$Ultimate##0 ~m := #in~m;~n := #in~n; 11874#L17 assume !(0 == ~m); 11873#L20 assume !(0 == ~n); 11868#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11871#$Ultimate##0 ~m := #in~m;~n := #in~n; 11914#L17 assume !(0 == ~m); 11932#L20 assume 0 == ~n; 11870#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11876#$Ultimate##0 ~m := #in~m;~n := #in~n; 11874#L17 assume 0 == ~m;#res := 1 + ~n; 11875#ackermannFINAL assume true; 11950#ackermannEXIT >#43#return; 11948#L21-1 #res := #t~ret4;havoc #t~ret4; 11946#ackermannFINAL assume true; 11944#ackermannEXIT >#45#return; 11939#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11940#$Ultimate##0 ~m := #in~m;~n := #in~n; 11943#L17 assume 0 == ~m;#res := 1 + ~n; 11942#ackermannFINAL assume true; 11938#ackermannEXIT >#47#return; 11936#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11934#ackermannFINAL assume true; 11930#ackermannEXIT >#43#return; 11928#L21-1 #res := #t~ret4;havoc #t~ret4; 11927#ackermannFINAL assume true; 11924#ackermannEXIT >#45#return; 11925#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11964#$Ultimate##0 ~m := #in~m;~n := #in~n; 11984#L17 assume !(0 == ~m); 11982#L20 assume !(0 == ~n); 11837#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11893#L17 assume !(0 == ~m); 11891#L20 assume 0 == ~n; 11861#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11862#$Ultimate##0 ~m := #in~m;~n := #in~n; 11953#L17 assume 0 == ~m;#res := 1 + ~n; 11875#ackermannFINAL assume true; 11950#ackermannEXIT >#43#return; 11866#L21-1 #res := #t~ret4;havoc #t~ret4; 11867#ackermannFINAL assume true; 11998#ackermannEXIT >#45#return; 11853#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11865#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11832#ackermannFINAL assume true; 11839#ackermannEXIT >#45#return; 11851#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11994#ackermannFINAL assume true; 11980#ackermannEXIT >#45#return; 11854#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11968#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11966#ackermannFINAL assume true; 11962#ackermannEXIT >#47#return; 11960#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11959#ackermannFINAL assume true; 11956#ackermannEXIT >#43#return; 11958#L21-1 #res := #t~ret4;havoc #t~ret4; 12000#ackermannFINAL assume true; 11997#ackermannEXIT >#45#return; 11881#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11921#$Ultimate##0 ~m := #in~m;~n := #in~n; 11922#L17 assume !(0 == ~m); 11990#L20 assume !(0 == ~n); 11838#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11848#$Ultimate##0 ~m := #in~m;~n := #in~n; 11849#L17 assume !(0 == ~m); 11857#L20 assume !(0 == ~n); 11834#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11848#$Ultimate##0 ~m := #in~m;~n := #in~n; 11849#L17 assume !(0 == ~m); 11857#L20 assume !(0 == ~n); 11834#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11848#$Ultimate##0 ~m := #in~m;~n := #in~n; 11850#L17 assume !(0 == ~m); 11858#L20 assume 0 == ~n; 11859#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11876#$Ultimate##0 ~m := #in~m;~n := #in~n; 11874#L17 assume !(0 == ~m); 11873#L20 assume !(0 == ~n); 11868#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11871#$Ultimate##0 ~m := #in~m;~n := #in~n; 11914#L17 assume !(0 == ~m); 11932#L20 assume 0 == ~n; 11870#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11876#$Ultimate##0 ~m := #in~m;~n := #in~n; 11874#L17 assume !(0 == ~m); 11873#L20 assume !(0 == ~n); 11868#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11871#$Ultimate##0 ~m := #in~m;~n := #in~n; 11914#L17 assume !(0 == ~m); 11932#L20 assume 0 == ~n; 11870#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11876#$Ultimate##0 ~m := #in~m;~n := #in~n; 11874#L17 assume 0 == ~m;#res := 1 + ~n; 11875#ackermannFINAL assume true; 11950#ackermannEXIT >#43#return; 11948#L21-1 #res := #t~ret4;havoc #t~ret4; 11946#ackermannFINAL assume true; 11944#ackermannEXIT >#45#return; 11939#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11940#$Ultimate##0 ~m := #in~m;~n := #in~n; 11943#L17 assume 0 == ~m;#res := 1 + ~n; 11942#ackermannFINAL assume true; 11938#ackermannEXIT >#47#return; 11936#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11934#ackermannFINAL assume true; 11930#ackermannEXIT >#43#return; 11928#L21-1 #res := #t~ret4;havoc #t~ret4; 11927#ackermannFINAL assume true; 11924#ackermannEXIT >#45#return; 11925#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11964#$Ultimate##0 ~m := #in~m;~n := #in~n; 11984#L17 assume !(0 == ~m); 11982#L20 assume !(0 == ~n); 11837#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11893#L17 assume !(0 == ~m); 11891#L20 assume 0 == ~n; 11861#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11862#$Ultimate##0 ~m := #in~m;~n := #in~n; 11953#L17 assume 0 == ~m;#res := 1 + ~n; 11875#ackermannFINAL assume true; 11950#ackermannEXIT >#43#return; 11866#L21-1 #res := #t~ret4;havoc #t~ret4; 11867#ackermannFINAL assume true; 11998#ackermannEXIT >#45#return; 11853#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11865#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11832#ackermannFINAL assume true; 11839#ackermannEXIT >#45#return; 11851#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11994#ackermannFINAL assume true; 11980#ackermannEXIT >#45#return; 11854#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11968#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11966#ackermannFINAL assume true; 11962#ackermannEXIT >#47#return; 11960#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11959#ackermannFINAL assume true; 11956#ackermannEXIT >#43#return; 11958#L21-1 #res := #t~ret4;havoc #t~ret4; 12000#ackermannFINAL assume true; 11997#ackermannEXIT >#45#return; 11881#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11921#$Ultimate##0 ~m := #in~m;~n := #in~n; 11922#L17 assume !(0 == ~m); 11990#L20 assume !(0 == ~n); 11838#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11848#$Ultimate##0 ~m := #in~m;~n := #in~n; 11849#L17 assume !(0 == ~m); 11857#L20 assume !(0 == ~n); 11834#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11848#$Ultimate##0 ~m := #in~m;~n := #in~n; 11849#L17 assume !(0 == ~m); 11857#L20 assume !(0 == ~n); 11834#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11848#$Ultimate##0 ~m := #in~m;~n := #in~n; 11850#L17 assume !(0 == ~m); 11858#L20 assume 0 == ~n; 11859#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11876#$Ultimate##0 ~m := #in~m;~n := #in~n; 11874#L17 assume 0 == ~m;#res := 1 + ~n; 11875#ackermannFINAL assume true; 11950#ackermannEXIT >#43#return; 11866#L21-1 #res := #t~ret4;havoc #t~ret4; 11867#ackermannFINAL assume true; 11998#ackermannEXIT >#45#return; 11853#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11865#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11832#ackermannFINAL assume true; 11839#ackermannEXIT >#45#return; 11851#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11994#ackermannFINAL assume true; 11980#ackermannEXIT >#45#return; 11855#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11988#ackermannFINAL assume true; 11973#ackermannEXIT >#47#return; 11975#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11955#ackermannFINAL assume true; 11926#ackermannEXIT >#45#return; 11916#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11915#$Ultimate##0 ~m := #in~m;~n := #in~n; 11920#L17 assume !(0 == ~m); 11991#L20 assume !(0 == ~n); 11836#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11893#L17 assume !(0 == ~m); 11891#L20 assume 0 == ~n; 11861#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11862#$Ultimate##0 ~m := #in~m;~n := #in~n; 11953#L17 assume 0 == ~m;#res := 1 + ~n; 11875#ackermannFINAL assume true; 11950#ackermannEXIT >#43#return; 11866#L21-1 #res := #t~ret4;havoc #t~ret4; 11867#ackermannFINAL assume true; 11998#ackermannEXIT >#45#return; 11853#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11865#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11832#ackermannFINAL assume true; 11839#ackermannEXIT >#45#return; 11851#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11994#ackermannFINAL assume true; 11980#ackermannEXIT >#45#return; 11855#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11988#ackermannFINAL assume true; 11973#ackermannEXIT >#47#return; 11974#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11993#ackermannFINAL assume true; 11979#ackermannEXIT >#45#return; 11918#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11915#$Ultimate##0 ~m := #in~m;~n := #in~n; 11920#L17 assume !(0 == ~m); 11991#L20 assume !(0 == ~n); 11836#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11893#L17 assume !(0 == ~m); 11891#L20 assume 0 == ~n; 11861#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11862#$Ultimate##0 ~m := #in~m;~n := #in~n; 11953#L17 assume 0 == ~m;#res := 1 + ~n; 11875#ackermannFINAL assume true; 11950#ackermannEXIT >#43#return; 11866#L21-1 #res := #t~ret4;havoc #t~ret4; 11867#ackermannFINAL assume true; 11998#ackermannEXIT >#45#return; 11853#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11865#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11832#ackermannFINAL assume true; 11839#ackermannEXIT >#45#return; 11851#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11994#ackermannFINAL assume true; 11980#ackermannEXIT >#45#return; 11855#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11988#ackermannFINAL assume true; 11973#ackermannEXIT >#47#return; 11971#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11987#ackermannFINAL assume true; 11969#ackermannEXIT >#47#return; 11972#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11996#ackermannFINAL assume true; 11995#ackermannEXIT >#45#return; 11877#L23-1 [2023-02-19 00:15:00,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:15:00,113 INFO L85 PathProgramCache]: Analyzing trace with hash 478890302, now seen corresponding path program 7 times [2023-02-19 00:15:00,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:15:00,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51656178] [2023-02-19 00:15:00,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:15:00,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:15:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:15:00,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-19 00:15:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-19 00:15:00,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-19 00:15:00,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:15:00,144 INFO L85 PathProgramCache]: Analyzing trace with hash 888511461, now seen corresponding path program 5 times [2023-02-19 00:15:00,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:15:00,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306406217] [2023-02-19 00:15:00,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:15:00,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:15:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:00,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-19 00:15:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:00,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:00,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:15:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-19 00:15:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:15:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-19 00:15:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-02-19 00:15:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-02-19 00:15:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8238 backedges. 1382 proven. 1901 refuted. 0 times theorem prover too weak. 4955 trivial. 0 not checked. [2023-02-19 00:15:01,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:15:01,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306406217] [2023-02-19 00:15:01,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306406217] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:15:01,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456837272] [2023-02-19 00:15:01,852 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-19 00:15:01,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:15:01,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:15:01,855 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:15:01,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Waiting until timeout for monitored process [2023-02-19 00:15:02,064 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-02-19 00:15:02,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-19 00:15:02,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-19 00:15:02,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:15:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8238 backedges. 787 proven. 1614 refuted. 0 times theorem prover too weak. 5837 trivial. 0 not checked. [2023-02-19 00:15:02,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:15:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8238 backedges. 841 proven. 1606 refuted. 0 times theorem prover too weak. 5791 trivial. 0 not checked. [2023-02-19 00:15:03,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456837272] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:15:03,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:15:03,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 28] total 49 [2023-02-19 00:15:03,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671701152] [2023-02-19 00:15:03,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:15:03,074 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-19 00:15:03,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:15:03,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-19 00:15:03,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2151, Unknown=0, NotChecked=0, Total=2352 [2023-02-19 00:15:03,075 INFO L87 Difference]: Start difference. First operand 170 states and 223 transitions. cyclomatic complexity: 57 Second operand has 49 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 30 states have internal predecessors, (79), 22 states have call successors, (26), 1 states have call predecessors, (26), 23 states have return successors, (53), 32 states have call predecessors, (53), 22 states have call successors, (53) [2023-02-19 00:15:04,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:15:04,646 INFO L93 Difference]: Finished difference Result 312 states and 453 transitions. [2023-02-19 00:15:04,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 453 transitions. [2023-02-19 00:15:04,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2023-02-19 00:15:04,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 283 states and 396 transitions. [2023-02-19 00:15:04,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2023-02-19 00:15:04,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 234 [2023-02-19 00:15:04,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 283 states and 396 transitions. [2023-02-19 00:15:04,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:15:04,652 INFO L218 hiAutomatonCegarLoop]: Abstraction has 283 states and 396 transitions. [2023-02-19 00:15:04,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states and 396 transitions. [2023-02-19 00:15:04,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 241. [2023-02-19 00:15:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 152 states have (on average 1.0460526315789473) internal successors, (159), 156 states have internal predecessors, (159), 52 states have call successors, (55), 25 states have call predecessors, (55), 37 states have return successors, (104), 59 states have call predecessors, (104), 48 states have call successors, (104) [2023-02-19 00:15:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 318 transitions. [2023-02-19 00:15:04,658 INFO L240 hiAutomatonCegarLoop]: Abstraction has 241 states and 318 transitions. [2023-02-19 00:15:04,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-02-19 00:15:04,659 INFO L428 stractBuchiCegarLoop]: Abstraction has 241 states and 318 transitions. [2023-02-19 00:15:04,659 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-02-19 00:15:04,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 318 transitions. [2023-02-19 00:15:04,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2023-02-19 00:15:04,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:15:04,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:15:04,663 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [66, 64, 39, 27, 27, 27, 27, 26, 26, 26, 12, 12, 11, 11, 1, 1, 1, 1, 1] [2023-02-19 00:15:04,663 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [66, 64, 39, 27, 27, 27, 27, 27, 26, 26, 12, 12, 11, 11] [2023-02-19 00:15:04,663 INFO L748 eck$LassoCheckResult]: Stem: 16872#$Ultimate##0 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); 16819#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; 16816#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; 16817#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 16818#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 16820#$Ultimate##0 ~m := #in~m;~n := #in~n; 16881#L17 assume !(0 == ~m); 16874#L20 assume 0 == ~n; 16862#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16863#$Ultimate##0 ~m := #in~m;~n := #in~n; 16928#L17 assume !(0 == ~m); 16927#L20 assume !(0 == ~n); 16877#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16880#$Ultimate##0 ~m := #in~m;~n := #in~n; 16879#L17 assume !(0 == ~m); 16875#L20 assume 0 == ~n; 16878#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16890#$Ultimate##0 ~m := #in~m;~n := #in~n; 16888#L17 assume !(0 == ~m); 16882#L20 assume !(0 == ~n); 16876#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16880#$Ultimate##0 ~m := #in~m;~n := #in~n; 16879#L17 assume !(0 == ~m); 16875#L20 assume 0 == ~n; 16878#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16890#$Ultimate##0 ~m := #in~m;~n := #in~n; 16888#L17 assume !(0 == ~m); 16882#L20 assume !(0 == ~n); 16876#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16880#$Ultimate##0 ~m := #in~m;~n := #in~n; 16879#L17 assume !(0 == ~m); 16875#L20 assume 0 == ~n; 16878#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16890#$Ultimate##0 ~m := #in~m;~n := #in~n; 16888#L17 assume !(0 == ~m); 16882#L20 assume !(0 == ~n); 16876#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16880#$Ultimate##0 ~m := #in~m;~n := #in~n; 16879#L17 assume !(0 == ~m); 16875#L20 assume 0 == ~n; 16878#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16922#$Ultimate##0 ~m := #in~m;~n := #in~n; 16970#L17 assume 0 == ~m;#res := 1 + ~n; 16967#ackermannFINAL assume true; 16965#ackermannEXIT >#43#return; 16963#L21-1 #res := #t~ret4;havoc #t~ret4; 16960#ackermannFINAL assume true; 16957#ackermannEXIT >#45#return; 16951#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16952#$Ultimate##0 ~m := #in~m;~n := #in~n; 16962#L17 assume 0 == ~m;#res := 1 + ~n; 16956#ackermannFINAL assume true; 16950#ackermannEXIT >#47#return; 16948#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16946#ackermannFINAL assume true; 16944#ackermannEXIT >#43#return; 16943#L21-1 #res := #t~ret4;havoc #t~ret4; 16942#ackermannFINAL assume true; 16941#ackermannEXIT >#45#return; 16939#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16940#$Ultimate##0 ~m := #in~m;~n := #in~n; 16983#L17 assume !(0 == ~m); 16982#L20 assume !(0 == ~n); 16861#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16837#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16975#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16974#ackermannFINAL assume true; 16938#ackermannEXIT >#47#return; 16935#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16934#ackermannFINAL assume true; 16930#ackermannEXIT >#43#return; 16929#L21-1 #res := #t~ret4;havoc #t~ret4; 16926#ackermannFINAL assume true; 16923#ackermannEXIT >#45#return; 16924#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16998#$Ultimate##0 ~m := #in~m;~n := #in~n; 17011#L17 assume !(0 == ~m); 17009#L20 assume !(0 == ~n); 16865#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16912#$Ultimate##0 ~m := #in~m;~n := #in~n; 16913#L17 assume !(0 == ~m); 16915#L20 assume !(0 == ~n); 16866#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16912#$Ultimate##0 ~m := #in~m;~n := #in~n; 16913#L17 assume !(0 == ~m); 16915#L20 assume !(0 == ~n); 16866#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16912#$Ultimate##0 ~m := #in~m;~n := #in~n; 16913#L17 assume !(0 == ~m); 16915#L20 assume !(0 == ~n); 16866#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16912#$Ultimate##0 ~m := #in~m;~n := #in~n; 16911#L17 assume !(0 == ~m); 16910#L20 assume 0 == ~n; 16906#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16909#$Ultimate##0 ~m := #in~m;~n := #in~n; 16908#L17 assume !(0 == ~m); 16907#L20 assume !(0 == ~n); 16900#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16902#$Ultimate##0 ~m := #in~m;~n := #in~n; 16901#L17 assume !(0 == ~m); 16899#L20 assume 0 == ~n; 16824#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16966#L21-1 #res := #t~ret4;havoc #t~ret4; 16964#ackermannFINAL assume true; 16961#ackermannEXIT >#45#return; 16954#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16955#$Ultimate##0 ~m := #in~m;~n := #in~n; 16959#L17 assume 0 == ~m;#res := 1 + ~n; 16958#ackermannFINAL assume true; 16953#ackermannEXIT >#47#return; 16949#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16947#ackermannFINAL assume true; 16945#ackermannEXIT >#43#return; 16864#L21-1 #res := #t~ret4;havoc #t~ret4; 16867#ackermannFINAL assume true; 17047#ackermannEXIT >#45#return; 16810#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16916#$Ultimate##0 ~m := #in~m;~n := #in~n; 16917#L17 assume !(0 == ~m); 16987#L20 assume !(0 == ~n); 16860#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16832#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16868#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16809#ackermannFINAL assume true; 16815#ackermannEXIT >#47#return; 16831#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17049#ackermannFINAL assume true; 17048#ackermannEXIT >#45#return; 16812#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16916#$Ultimate##0 ~m := #in~m;~n := #in~n; 16917#L17 assume !(0 == ~m); 16987#L20 assume !(0 == ~n); 16860#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16836#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16984#ackermannFINAL assume true; 16981#ackermannEXIT >#45#return; 16839#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16980#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17007#ackermannFINAL assume true; 17003#ackermannEXIT >#47#return; 17006#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17046#ackermannFINAL assume true; 17045#ackermannEXIT >#45#return; 16811#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16916#$Ultimate##0 ~m := #in~m;~n := #in~n; 16917#L17 assume !(0 == ~m); 16987#L20 assume !(0 == ~n); 16860#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16836#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16984#ackermannFINAL assume true; 16981#ackermannEXIT >#45#return; 16839#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16980#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17007#ackermannFINAL assume true; 17003#ackermannEXIT >#47#return; 17004#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17017#ackermannFINAL assume true; 17008#ackermannEXIT >#45#return; 16813#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16916#$Ultimate##0 ~m := #in~m;~n := #in~n; 16917#L17 assume !(0 == ~m); 16987#L20 assume !(0 == ~n); 16860#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16836#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16984#ackermannFINAL assume true; 16981#ackermannEXIT >#45#return; 16839#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16980#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17007#ackermannFINAL assume true; 17003#ackermannEXIT >#47#return; 17001#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16999#ackermannFINAL assume true; 16996#ackermannEXIT >#47#return; 16994#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16993#ackermannFINAL assume true; 16990#ackermannEXIT >#43#return; 16991#L21-1 #res := #t~ret4;havoc #t~ret4; 17002#ackermannFINAL assume true; 17000#ackermannEXIT >#45#return; 16897#L23-1 [2023-02-19 00:15:04,664 INFO L750 eck$LassoCheckResult]: Loop: 16897#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16997#$Ultimate##0 ~m := #in~m;~n := #in~n; 16921#L17 assume !(0 == ~m); 16936#L20 assume 0 == ~n; 16869#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16896#$Ultimate##0 ~m := #in~m;~n := #in~n; 16895#L17 assume !(0 == ~m); 16873#L20 assume !(0 == ~n); 16850#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16871#$Ultimate##0 ~m := #in~m;~n := #in~n; 16898#L17 assume !(0 == ~m); 16849#L20 assume 0 == ~n; 16851#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16932#$Ultimate##0 ~m := #in~m;~n := #in~n; 16972#L17 assume !(0 == ~m); 16873#L20 assume !(0 == ~n); 16850#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16871#$Ultimate##0 ~m := #in~m;~n := #in~n; 16898#L17 assume !(0 == ~m); 16849#L20 assume 0 == ~n; 16851#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16932#$Ultimate##0 ~m := #in~m;~n := #in~n; 16972#L17 assume !(0 == ~m); 16873#L20 assume !(0 == ~n); 16850#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16871#$Ultimate##0 ~m := #in~m;~n := #in~n; 16898#L17 assume !(0 == ~m); 16849#L20 assume 0 == ~n; 16851#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16932#$Ultimate##0 ~m := #in~m;~n := #in~n; 16972#L17 assume !(0 == ~m); 16873#L20 assume !(0 == ~n); 16850#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16871#$Ultimate##0 ~m := #in~m;~n := #in~n; 16898#L17 assume !(0 == ~m); 16849#L20 assume 0 == ~n; 16851#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16932#$Ultimate##0 ~m := #in~m;~n := #in~n; 16972#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16966#L21-1 #res := #t~ret4;havoc #t~ret4; 16964#ackermannFINAL assume true; 16961#ackermannEXIT >#45#return; 16954#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16955#$Ultimate##0 ~m := #in~m;~n := #in~n; 16959#L17 assume 0 == ~m;#res := 1 + ~n; 16958#ackermannFINAL assume true; 16953#ackermannEXIT >#47#return; 16949#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16947#ackermannFINAL assume true; 16945#ackermannEXIT >#43#return; 16943#L21-1 #res := #t~ret4;havoc #t~ret4; 16942#ackermannFINAL assume true; 16941#ackermannEXIT >#45#return; 16939#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16940#$Ultimate##0 ~m := #in~m;~n := #in~n; 16983#L17 assume !(0 == ~m); 16982#L20 assume !(0 == ~n); 16861#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16837#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16975#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16974#ackermannFINAL assume true; 16938#ackermannEXIT >#47#return; 16935#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16934#ackermannFINAL assume true; 16930#ackermannEXIT >#43#return; 16929#L21-1 #res := #t~ret4;havoc #t~ret4; 16926#ackermannFINAL assume true; 16923#ackermannEXIT >#45#return; 16924#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16998#$Ultimate##0 ~m := #in~m;~n := #in~n; 17011#L17 assume !(0 == ~m); 17009#L20 assume !(0 == ~n); 16865#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16912#$Ultimate##0 ~m := #in~m;~n := #in~n; 16913#L17 assume !(0 == ~m); 16915#L20 assume !(0 == ~n); 16866#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16912#$Ultimate##0 ~m := #in~m;~n := #in~n; 16913#L17 assume !(0 == ~m); 16915#L20 assume !(0 == ~n); 16866#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16912#$Ultimate##0 ~m := #in~m;~n := #in~n; 16913#L17 assume !(0 == ~m); 16915#L20 assume !(0 == ~n); 16866#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16912#$Ultimate##0 ~m := #in~m;~n := #in~n; 16911#L17 assume !(0 == ~m); 16910#L20 assume 0 == ~n; 16906#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16909#$Ultimate##0 ~m := #in~m;~n := #in~n; 16908#L17 assume !(0 == ~m); 16907#L20 assume !(0 == ~n); 16900#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16902#$Ultimate##0 ~m := #in~m;~n := #in~n; 16901#L17 assume !(0 == ~m); 16899#L20 assume 0 == ~n; 16824#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16966#L21-1 #res := #t~ret4;havoc #t~ret4; 16964#ackermannFINAL assume true; 16961#ackermannEXIT >#45#return; 16954#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16955#$Ultimate##0 ~m := #in~m;~n := #in~n; 16959#L17 assume 0 == ~m;#res := 1 + ~n; 16958#ackermannFINAL assume true; 16953#ackermannEXIT >#47#return; 16949#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16947#ackermannFINAL assume true; 16945#ackermannEXIT >#43#return; 16864#L21-1 #res := #t~ret4;havoc #t~ret4; 16867#ackermannFINAL assume true; 17047#ackermannEXIT >#45#return; 16810#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16916#$Ultimate##0 ~m := #in~m;~n := #in~n; 16917#L17 assume !(0 == ~m); 16987#L20 assume !(0 == ~n); 16860#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16832#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16868#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16809#ackermannFINAL assume true; 16815#ackermannEXIT >#47#return; 16831#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17049#ackermannFINAL assume true; 17048#ackermannEXIT >#45#return; 16812#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16916#$Ultimate##0 ~m := #in~m;~n := #in~n; 16917#L17 assume !(0 == ~m); 16987#L20 assume !(0 == ~n); 16860#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16836#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16984#ackermannFINAL assume true; 16981#ackermannEXIT >#45#return; 16839#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16980#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17007#ackermannFINAL assume true; 17003#ackermannEXIT >#47#return; 17006#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17046#ackermannFINAL assume true; 17045#ackermannEXIT >#45#return; 16811#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16916#$Ultimate##0 ~m := #in~m;~n := #in~n; 16917#L17 assume !(0 == ~m); 16987#L20 assume !(0 == ~n); 16860#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16836#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16984#ackermannFINAL assume true; 16981#ackermannEXIT >#45#return; 16839#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16980#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17007#ackermannFINAL assume true; 17003#ackermannEXIT >#47#return; 17004#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17017#ackermannFINAL assume true; 17008#ackermannEXIT >#45#return; 16813#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16916#$Ultimate##0 ~m := #in~m;~n := #in~n; 16917#L17 assume !(0 == ~m); 16987#L20 assume !(0 == ~n); 16860#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16836#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16984#ackermannFINAL assume true; 16981#ackermannEXIT >#45#return; 16839#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16980#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17007#ackermannFINAL assume true; 17003#ackermannEXIT >#47#return; 17001#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16999#ackermannFINAL assume true; 16996#ackermannEXIT >#47#return; 16994#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16993#ackermannFINAL assume true; 16990#ackermannEXIT >#43#return; 16991#L21-1 #res := #t~ret4;havoc #t~ret4; 17002#ackermannFINAL assume true; 17000#ackermannEXIT >#45#return; 16897#L23-1 [2023-02-19 00:15:04,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:15:04,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1815337676, now seen corresponding path program 8 times [2023-02-19 00:15:04,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:15:04,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807531536] [2023-02-19 00:15:04,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:15:04,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:15:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:04,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-19 00:15:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:15:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:05,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-19 00:15:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:15:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:15:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-02-19 00:15:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-02-19 00:15:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10185 backedges. 1021 proven. 2360 refuted. 0 times theorem prover too weak. 6804 trivial. 0 not checked. [2023-02-19 00:15:06,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:15:06,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807531536] [2023-02-19 00:15:06,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807531536] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:15:06,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786612484] [2023-02-19 00:15:06,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-19 00:15:06,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:15:06,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:15:06,284 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:15:06,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Waiting until timeout for monitored process [2023-02-19 00:15:06,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-19 00:15:06,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-19 00:15:06,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-19 00:15:06,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:15:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10185 backedges. 366 proven. 1883 refuted. 0 times theorem prover too weak. 7936 trivial. 0 not checked. [2023-02-19 00:15:06,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:15:07,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10185 backedges. 366 proven. 1935 refuted. 0 times theorem prover too weak. 7884 trivial. 0 not checked. [2023-02-19 00:15:07,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786612484] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:15:07,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:15:07,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 12, 16] total 43 [2023-02-19 00:15:07,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79225701] [2023-02-19 00:15:07,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:15:07,108 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-19 00:15:07,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:15:07,108 INFO L85 PathProgramCache]: Analyzing trace with hash 41962951, now seen corresponding path program 6 times [2023-02-19 00:15:07,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:15:07,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495658539] [2023-02-19 00:15:07,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:15:07,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:15:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:07,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-19 00:15:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:07,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:15:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-19 00:15:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:15:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:15:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-02-19 00:15:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-02-19 00:15:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10211 backedges. 1059 proven. 1993 refuted. 0 times theorem prover too weak. 7159 trivial. 0 not checked. [2023-02-19 00:15:08,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:15:08,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495658539] [2023-02-19 00:15:08,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495658539] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:15:08,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268959761] [2023-02-19 00:15:08,842 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-19 00:15:08,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:15:08,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:15:08,882 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:15:08,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Waiting until timeout for monitored process [2023-02-19 00:15:09,248 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2023-02-19 00:15:09,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-19 00:15:09,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-19 00:15:09,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:15:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10211 backedges. 1031 proven. 2007 refuted. 0 times theorem prover too weak. 7173 trivial. 0 not checked. [2023-02-19 00:15:09,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:15:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10211 backedges. 1087 proven. 2011 refuted. 0 times theorem prover too weak. 7113 trivial. 0 not checked. [2023-02-19 00:15:10,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268959761] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:15:10,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:15:10,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 29] total 35 [2023-02-19 00:15:10,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985425035] [2023-02-19 00:15:10,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:15:10,053 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-19 00:15:10,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:15:10,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-19 00:15:10,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1023, Unknown=0, NotChecked=0, Total=1190 [2023-02-19 00:15:10,054 INFO L87 Difference]: Start difference. First operand 241 states and 318 transitions. cyclomatic complexity: 82 Second operand has 35 states, 31 states have (on average 2.225806451612903) internal successors, (69), 26 states have internal predecessors, (69), 17 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (39), 17 states have call predecessors, (39), 17 states have call successors, (39) [2023-02-19 00:15:10,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:15:10,567 INFO L93 Difference]: Finished difference Result 307 states and 427 transitions. [2023-02-19 00:15:10,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 427 transitions. [2023-02-19 00:15:10,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2023-02-19 00:15:10,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 291 states and 401 transitions. [2023-02-19 00:15:10,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2023-02-19 00:15:10,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2023-02-19 00:15:10,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 291 states and 401 transitions. [2023-02-19 00:15:10,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:15:10,573 INFO L218 hiAutomatonCegarLoop]: Abstraction has 291 states and 401 transitions. [2023-02-19 00:15:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states and 401 transitions. [2023-02-19 00:15:10,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 257. [2023-02-19 00:15:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 160 states have (on average 1.04375) internal successors, (167), 164 states have internal predecessors, (167), 56 states have call successors, (59), 25 states have call predecessors, (59), 41 states have return successors, (120), 67 states have call predecessors, (120), 52 states have call successors, (120) [2023-02-19 00:15:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 346 transitions. [2023-02-19 00:15:10,579 INFO L240 hiAutomatonCegarLoop]: Abstraction has 257 states and 346 transitions. [2023-02-19 00:15:10,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-19 00:15:10,580 INFO L428 stractBuchiCegarLoop]: Abstraction has 257 states and 346 transitions. [2023-02-19 00:15:10,580 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-02-19 00:15:10,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 257 states and 346 transitions. [2023-02-19 00:15:10,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-02-19 00:15:10,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:15:10,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:15:10,584 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [88, 87, 50, 38, 38, 38, 38, 37, 37, 37, 12, 12, 12, 12, 1, 1, 1, 1, 1] [2023-02-19 00:15:10,584 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [88, 87, 50, 38, 38, 38, 38, 38, 37, 37, 12, 12, 12, 12] [2023-02-19 00:15:10,585 INFO L748 eck$LassoCheckResult]: Stem: 27780#$Ultimate##0 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); 27732#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; 27729#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; 27730#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 27731#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 27733#$Ultimate##0 ~m := #in~m;~n := #in~n; 27804#L17 assume !(0 == ~m); 27802#L20 assume !(0 == ~n); 27723#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27796#$Ultimate##0 ~m := #in~m;~n := #in~n; 27797#L17 assume !(0 == ~m); 27789#L20 assume 0 == ~n; 27790#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27800#$Ultimate##0 ~m := #in~m;~n := #in~n; 27798#L17 assume !(0 == ~m); 27795#L20 assume !(0 == ~n); 27788#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27792#$Ultimate##0 ~m := #in~m;~n := #in~n; 27791#L17 assume !(0 == ~m); 27786#L20 assume 0 == ~n; 27735#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27800#$Ultimate##0 ~m := #in~m;~n := #in~n; 27798#L17 assume !(0 == ~m); 27795#L20 assume !(0 == ~n); 27788#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27792#$Ultimate##0 ~m := #in~m;~n := #in~n; 27791#L17 assume !(0 == ~m); 27786#L20 assume 0 == ~n; 27735#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27800#$Ultimate##0 ~m := #in~m;~n := #in~n; 27798#L17 assume !(0 == ~m); 27795#L20 assume !(0 == ~n); 27788#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27792#$Ultimate##0 ~m := #in~m;~n := #in~n; 27791#L17 assume !(0 == ~m); 27786#L20 assume 0 == ~n; 27735#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27734#$Ultimate##0 ~m := #in~m;~n := #in~n; 27736#L17 assume 0 == ~m;#res := 1 + ~n; 27889#ackermannFINAL assume true; 27888#ackermannEXIT >#43#return; 27887#L21-1 #res := #t~ret4;havoc #t~ret4; 27886#ackermannFINAL assume true; 27883#ackermannEXIT >#45#return; 27869#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27870#$Ultimate##0 ~m := #in~m;~n := #in~n; 27876#L17 assume 0 == ~m;#res := 1 + ~n; 27874#ackermannFINAL assume true; 27868#ackermannEXIT >#47#return; 27866#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27864#ackermannFINAL assume true; 27861#ackermannEXIT >#43#return; 27860#L21-1 #res := #t~ret4;havoc #t~ret4; 27859#ackermannFINAL assume true; 27858#ackermannEXIT >#45#return; 27856#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27857#$Ultimate##0 ~m := #in~m;~n := #in~n; 27901#L17 assume !(0 == ~m); 27900#L20 assume !(0 == ~n); 27768#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27744#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27891#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27890#ackermannFINAL assume true; 27855#ackermannEXIT >#47#return; 27854#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27853#ackermannFINAL assume true; 27850#ackermannEXIT >#43#return; 27849#L21-1 #res := #t~ret4;havoc #t~ret4; 27846#ackermannFINAL assume true; 27843#ackermannEXIT >#45#return; 27844#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27915#$Ultimate##0 ~m := #in~m;~n := #in~n; 27931#L17 assume !(0 == ~m); 27929#L20 assume !(0 == ~n); 27756#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27828#L17 assume !(0 == ~m); 27754#L20 assume !(0 == ~n); 27755#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27828#L17 assume !(0 == ~m); 27754#L20 assume !(0 == ~n); 27755#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27828#L17 assume !(0 == ~m); 27754#L20 assume !(0 == ~n); 27755#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27828#L17 assume !(0 == ~m); 27754#L20 assume !(0 == ~n); 27755#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27827#L17 assume !(0 == ~m); 27826#L20 assume 0 == ~n; 27782#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27825#$Ultimate##0 ~m := #in~m;~n := #in~n; 27824#L17 assume !(0 == ~m); 27781#L20 assume !(0 == ~n); 27783#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27822#$Ultimate##0 ~m := #in~m;~n := #in~n; 27823#L17 assume !(0 == ~m); 27816#L20 assume 0 == ~n; 27817#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27878#L21-1 #res := #t~ret4;havoc #t~ret4; 27877#ackermannFINAL assume true; 27875#ackermannEXIT >#45#return; 27872#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27873#$Ultimate##0 ~m := #in~m;~n := #in~n; 27885#L17 assume 0 == ~m;#res := 1 + ~n; 27884#ackermannFINAL assume true; 27871#ackermannEXIT >#47#return; 27867#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27865#ackermannFINAL assume true; 27862#ackermannEXIT >#43#return; 27863#L21-1 #res := #t~ret4;havoc #t~ret4; 27960#ackermannFINAL assume true; 27958#ackermannEXIT >#45#return; 27758#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27922#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27961#ackermannFINAL assume true; 27959#ackermannEXIT >#45#return; 27759#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27923#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27957#ackermannFINAL assume true; 27956#ackermannEXIT >#45#return; 27763#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27926#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27955#ackermannFINAL assume true; 27954#ackermannEXIT >#45#return; 27760#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27924#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27952#ackermannFINAL assume true; 27928#ackermannEXIT >#45#return; 27762#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27919#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27917#ackermannFINAL assume true; 27913#ackermannEXIT >#47#return; 27912#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27911#ackermannFINAL assume true; 27909#ackermannEXIT >#43#return; 27774#L21-1 #res := #t~ret4;havoc #t~ret4; 27722#ackermannFINAL assume true; 27728#ackermannEXIT >#45#return; 27740#L23-1 [2023-02-19 00:15:10,585 INFO L750 eck$LassoCheckResult]: Loop: 27740#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27831#$Ultimate##0 ~m := #in~m;~n := #in~n; 27842#L17 assume !(0 == ~m); 27950#L20 assume !(0 == ~n); 27724#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27737#$Ultimate##0 ~m := #in~m;~n := #in~n; 27739#L17 assume !(0 == ~m); 27752#L20 assume 0 == ~n; 27753#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27813#$Ultimate##0 ~m := #in~m;~n := #in~n; 27784#L17 assume !(0 == ~m); 27785#L20 assume !(0 == ~n); 27775#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27778#$Ultimate##0 ~m := #in~m;~n := #in~n; 27830#L17 assume !(0 == ~m); 27852#L20 assume 0 == ~n; 27777#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27805#$Ultimate##0 ~m := #in~m;~n := #in~n; 27806#L17 assume !(0 == ~m); 27785#L20 assume !(0 == ~n); 27775#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27778#$Ultimate##0 ~m := #in~m;~n := #in~n; 27830#L17 assume !(0 == ~m); 27852#L20 assume 0 == ~n; 27777#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27805#$Ultimate##0 ~m := #in~m;~n := #in~n; 27806#L17 assume !(0 == ~m); 27785#L20 assume !(0 == ~n); 27775#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27778#$Ultimate##0 ~m := #in~m;~n := #in~n; 27830#L17 assume !(0 == ~m); 27852#L20 assume 0 == ~n; 27777#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27805#$Ultimate##0 ~m := #in~m;~n := #in~n; 27806#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27878#L21-1 #res := #t~ret4;havoc #t~ret4; 27877#ackermannFINAL assume true; 27875#ackermannEXIT >#45#return; 27872#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27873#$Ultimate##0 ~m := #in~m;~n := #in~n; 27885#L17 assume 0 == ~m;#res := 1 + ~n; 27884#ackermannFINAL assume true; 27871#ackermannEXIT >#47#return; 27867#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27865#ackermannFINAL assume true; 27862#ackermannEXIT >#43#return; 27860#L21-1 #res := #t~ret4;havoc #t~ret4; 27859#ackermannFINAL assume true; 27858#ackermannEXIT >#45#return; 27856#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27857#$Ultimate##0 ~m := #in~m;~n := #in~n; 27901#L17 assume !(0 == ~m); 27900#L20 assume !(0 == ~n); 27768#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27744#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27891#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27890#ackermannFINAL assume true; 27855#ackermannEXIT >#47#return; 27854#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27853#ackermannFINAL assume true; 27850#ackermannEXIT >#43#return; 27849#L21-1 #res := #t~ret4;havoc #t~ret4; 27846#ackermannFINAL assume true; 27843#ackermannEXIT >#45#return; 27844#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27915#$Ultimate##0 ~m := #in~m;~n := #in~n; 27931#L17 assume !(0 == ~m); 27929#L20 assume !(0 == ~n); 27756#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27828#L17 assume !(0 == ~m); 27754#L20 assume !(0 == ~n); 27755#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27828#L17 assume !(0 == ~m); 27754#L20 assume !(0 == ~n); 27755#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27828#L17 assume !(0 == ~m); 27754#L20 assume !(0 == ~n); 27755#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27828#L17 assume !(0 == ~m); 27754#L20 assume !(0 == ~n); 27755#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27827#L17 assume !(0 == ~m); 27826#L20 assume 0 == ~n; 27782#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27825#$Ultimate##0 ~m := #in~m;~n := #in~n; 27824#L17 assume !(0 == ~m); 27781#L20 assume !(0 == ~n); 27783#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27822#$Ultimate##0 ~m := #in~m;~n := #in~n; 27823#L17 assume !(0 == ~m); 27816#L20 assume 0 == ~n; 27817#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27878#L21-1 #res := #t~ret4;havoc #t~ret4; 27877#ackermannFINAL assume true; 27875#ackermannEXIT >#45#return; 27872#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27873#$Ultimate##0 ~m := #in~m;~n := #in~n; 27885#L17 assume 0 == ~m;#res := 1 + ~n; 27884#ackermannFINAL assume true; 27871#ackermannEXIT >#47#return; 27867#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27865#ackermannFINAL assume true; 27862#ackermannEXIT >#43#return; 27863#L21-1 #res := #t~ret4;havoc #t~ret4; 27960#ackermannFINAL assume true; 27958#ackermannEXIT >#45#return; 27758#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27922#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27961#ackermannFINAL assume true; 27959#ackermannEXIT >#45#return; 27759#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27923#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27957#ackermannFINAL assume true; 27956#ackermannEXIT >#45#return; 27763#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27926#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27955#ackermannFINAL assume true; 27954#ackermannEXIT >#45#return; 27760#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27924#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27952#ackermannFINAL assume true; 27928#ackermannEXIT >#45#return; 27762#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27919#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27917#ackermannFINAL assume true; 27913#ackermannEXIT >#47#return; 27912#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27911#ackermannFINAL assume true; 27909#ackermannEXIT >#43#return; 27774#L21-1 #res := #t~ret4;havoc #t~ret4; 27722#ackermannFINAL assume true; 27728#ackermannEXIT >#45#return; 27740#L23-1 [2023-02-19 00:15:10,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:15:10,586 INFO L85 PathProgramCache]: Analyzing trace with hash 301299634, now seen corresponding path program 9 times [2023-02-19 00:15:10,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:15:10,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890928647] [2023-02-19 00:15:10,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:15:10,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:15:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:10,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-19 00:15:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:15:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-19 00:15:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:11,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:15:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:15:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-02-19 00:15:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:15:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-02-19 00:15:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:15:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-02-19 00:15:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:15:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2023-02-19 00:15:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:15:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18530 backedges. 453 proven. 2429 refuted. 0 times theorem prover too weak. 15648 trivial. 0 not checked. [2023-02-19 00:15:12,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:15:12,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890928647] [2023-02-19 00:15:12,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890928647] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:15:12,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312833769] [2023-02-19 00:15:12,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-19 00:15:12,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:15:12,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:15:12,175 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:15:12,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Waiting until timeout for monitored process [2023-02-19 00:15:12,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2023-02-19 00:15:12,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-19 00:15:12,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-19 00:15:12,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:15:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 18530 backedges. 4786 proven. 609 refuted. 0 times theorem prover too weak. 13135 trivial. 0 not checked. [2023-02-19 00:15:12,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:15:14,601 INFO L134 CoverageAnalysis]: Checked inductivity of 18530 backedges. 4876 proven. 635 refuted. 0 times theorem prover too weak. 13019 trivial. 0 not checked. [2023-02-19 00:15:14,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312833769] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:15:14,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:15:14,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 28, 39] total 57 [2023-02-19 00:15:14,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677673854] [2023-02-19 00:15:14,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:15:14,603 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-19 00:15:14,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:15:14,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2130492481, now seen corresponding path program 7 times [2023-02-19 00:15:14,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:15:14,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914543016] [2023-02-19 00:15:14,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:15:14,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:15:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:16,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-19 00:15:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:18,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:20,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:20,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:20,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:20,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:20,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:20,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:20,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:20,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:15:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:20,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:20,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:20,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:20,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:20,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:20,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:20,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-19 00:15:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:21,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:15:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:15:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-02-19 00:15:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:15:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:23,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-02-19 00:15:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:15:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-02-19 00:15:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:15:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2023-02-19 00:15:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:15:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18567 backedges. 5933 proven. 3541 refuted. 0 times theorem prover too weak. 9093 trivial. 0 not checked. [2023-02-19 00:15:24,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:15:24,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914543016] [2023-02-19 00:15:24,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914543016] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:15:24,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995007358] [2023-02-19 00:15:24,307 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-19 00:15:24,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:15:24,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:15:24,319 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:15:24,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Waiting until timeout for monitored process [2023-02-19 00:15:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:24,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 1505 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-19 00:15:24,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:15:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 18567 backedges. 9946 proven. 233 refuted. 0 times theorem prover too weak. 8388 trivial. 0 not checked. [2023-02-19 00:15:25,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:15:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 18567 backedges. 2046 proven. 2567 refuted. 0 times theorem prover too weak. 13954 trivial. 0 not checked. [2023-02-19 00:15:26,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995007358] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:15:26,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:15:26,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 17, 24] total 43 [2023-02-19 00:15:26,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86626457] [2023-02-19 00:15:26,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:15:26,012 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-19 00:15:26,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:15:26,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-19 00:15:26,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1607, Unknown=0, NotChecked=0, Total=1806 [2023-02-19 00:15:26,013 INFO L87 Difference]: Start difference. First operand 257 states and 346 transitions. cyclomatic complexity: 94 Second operand has 43 states, 36 states have (on average 2.361111111111111) internal successors, (85), 31 states have internal predecessors, (85), 28 states have call successors, (33), 2 states have call predecessors, (33), 21 states have return successors, (62), 26 states have call predecessors, (62), 28 states have call successors, (62) [2023-02-19 00:15:26,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:15:26,645 INFO L93 Difference]: Finished difference Result 354 states and 525 transitions. [2023-02-19 00:15:26,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 525 transitions. [2023-02-19 00:15:26,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2023-02-19 00:15:26,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 343 states and 507 transitions. [2023-02-19 00:15:26,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 282 [2023-02-19 00:15:26,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 297 [2023-02-19 00:15:26,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 343 states and 507 transitions. [2023-02-19 00:15:26,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-19 00:15:26,654 INFO L218 hiAutomatonCegarLoop]: Abstraction has 343 states and 507 transitions. [2023-02-19 00:15:26,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states and 507 transitions. [2023-02-19 00:15:26,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 282. [2023-02-19 00:15:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 179 states have (on average 1.0391061452513966) internal successors, (186), 182 states have internal predecessors, (186), 59 states have call successors, (62), 32 states have call predecessors, (62), 44 states have return successors, (118), 67 states have call predecessors, (118), 55 states have call successors, (118) [2023-02-19 00:15:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 366 transitions. [2023-02-19 00:15:26,661 INFO L240 hiAutomatonCegarLoop]: Abstraction has 282 states and 366 transitions. [2023-02-19 00:15:26,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-19 00:15:26,662 INFO L428 stractBuchiCegarLoop]: Abstraction has 282 states and 366 transitions. [2023-02-19 00:15:26,662 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-02-19 00:15:26,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 366 transitions. [2023-02-19 00:15:26,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-02-19 00:15:26,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-19 00:15:26,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-19 00:15:26,692 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [84, 83, 48, 36, 36, 36, 36, 35, 35, 35, 12, 12, 12, 12, 1, 1, 1, 1, 1] [2023-02-19 00:15:26,692 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1341, 1340, 747, 594, 594, 594, 594, 594, 593, 593, 153, 153, 153, 153] [2023-02-19 00:15:26,693 INFO L748 eck$LassoCheckResult]: Stem: 43394#$Ultimate##0 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); 43350#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; 43347#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; 43348#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 43349#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 43351#$Ultimate##0 ~m := #in~m;~n := #in~n; 43412#L17 assume !(0 == ~m); 43410#L20 assume !(0 == ~n); 43388#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43405#$Ultimate##0 ~m := #in~m;~n := #in~n; 43406#L17 assume !(0 == ~m); 43449#L20 assume 0 == ~n; 43404#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43447#$Ultimate##0 ~m := #in~m;~n := #in~n; 43407#L17 assume !(0 == ~m); 43403#L20 assume !(0 == ~n); 43397#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43401#$Ultimate##0 ~m := #in~m;~n := #in~n; 43400#L17 assume !(0 == ~m); 43395#L20 assume 0 == ~n; 43398#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43447#$Ultimate##0 ~m := #in~m;~n := #in~n; 43407#L17 assume !(0 == ~m); 43403#L20 assume !(0 == ~n); 43397#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43401#$Ultimate##0 ~m := #in~m;~n := #in~n; 43400#L17 assume !(0 == ~m); 43395#L20 assume 0 == ~n; 43398#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43447#$Ultimate##0 ~m := #in~m;~n := #in~n; 43407#L17 assume !(0 == ~m); 43403#L20 assume !(0 == ~n); 43397#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43401#$Ultimate##0 ~m := #in~m;~n := #in~n; 43400#L17 assume !(0 == ~m); 43395#L20 assume 0 == ~n; 43398#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43446#$Ultimate##0 ~m := #in~m;~n := #in~n; 43490#L17 assume 0 == ~m;#res := 1 + ~n; 43488#ackermannFINAL assume true; 43487#ackermannEXIT >#43#return; 43485#L21-1 #res := #t~ret4;havoc #t~ret4; 43483#ackermannFINAL assume true; 43482#ackermannEXIT >#45#return; 43480#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43481#$Ultimate##0 ~m := #in~m;~n := #in~n; 43486#L17 assume 0 == ~m;#res := 1 + ~n; 43484#ackermannFINAL assume true; 43479#ackermannEXIT >#47#return; 43477#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43476#ackermannFINAL assume true; 43444#ackermannEXIT >#43#return; 43442#L21-1 #res := #t~ret4;havoc #t~ret4; 43436#ackermannFINAL assume true; 43430#ackermannEXIT >#45#return; 43415#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43418#$Ultimate##0 ~m := #in~m;~n := #in~n; 43417#L17 assume !(0 == ~m); 43414#L20 assume !(0 == ~n); 43416#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43538#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43533#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43530#ackermannFINAL assume true; 43527#ackermannEXIT >#47#return; 43525#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43523#ackermannFINAL assume true; 43518#ackermannEXIT >#43#return; 43519#L21-1 #res := #t~ret4;havoc #t~ret4; 43534#ackermannFINAL assume true; 43531#ackermannEXIT >#45#return; 43502#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43509#$Ultimate##0 ~m := #in~m;~n := #in~n; 43508#L17 assume !(0 == ~m); 43501#L20 assume !(0 == ~n); 43424#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43364#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43567#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43565#ackermannFINAL assume true; 43528#ackermannEXIT >#47#return; 43526#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43524#ackermannFINAL assume true; 43520#ackermannEXIT >#43#return; 43522#L21-1 #res := #t~ret4;havoc #t~ret4; 43615#ackermannFINAL assume true; 43614#ackermannEXIT >#45#return; 43372#L23-1 [2023-02-19 00:15:26,698 INFO L750 eck$LassoCheckResult]: Loop: 43372#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43517#$Ultimate##0 ~m := #in~m;~n := #in~n; 43512#L17 assume !(0 == ~m); 43513#L20 assume !(0 == ~n); 43344#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43465#L17 assume !(0 == ~m); 43462#L20 assume 0 == ~n; 43433#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43419#$Ultimate##0 ~m := #in~m;~n := #in~n; 43478#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43442#L21-1 #res := #t~ret4;havoc #t~ret4; 43436#ackermannFINAL assume true; 43430#ackermannEXIT >#45#return; 43415#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43418#$Ultimate##0 ~m := #in~m;~n := #in~n; 43417#L17 assume !(0 == ~m); 43414#L20 assume !(0 == ~n); 43416#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43538#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43533#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43530#ackermannFINAL assume true; 43527#ackermannEXIT >#47#return; 43525#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43523#ackermannFINAL assume true; 43518#ackermannEXIT >#43#return; 43519#L21-1 #res := #t~ret4;havoc #t~ret4; 43534#ackermannFINAL assume true; 43531#ackermannEXIT >#45#return; 43502#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43509#$Ultimate##0 ~m := #in~m;~n := #in~n; 43508#L17 assume !(0 == ~m); 43501#L20 assume !(0 == ~n); 43424#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43364#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43567#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43565#ackermannFINAL assume true; 43528#ackermannEXIT >#47#return; 43526#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43524#ackermannFINAL assume true; 43520#ackermannEXIT >#43#return; 43522#L21-1 #res := #t~ret4;havoc #t~ret4; 43615#ackermannFINAL assume true; 43614#ackermannEXIT >#45#return; 43376#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43517#$Ultimate##0 ~m := #in~m;~n := #in~n; 43512#L17 assume !(0 == ~m); 43513#L20 assume !(0 == ~n); 43344#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43465#L17 assume !(0 == ~m); 43462#L20 assume 0 == ~n; 43433#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43419#$Ultimate##0 ~m := #in~m;~n := #in~n; 43478#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43442#L21-1 #res := #t~ret4;havoc #t~ret4; 43436#ackermannFINAL assume true; 43430#ackermannEXIT >#45#return; 43415#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43418#$Ultimate##0 ~m := #in~m;~n := #in~n; 43417#L17 assume !(0 == ~m); 43414#L20 assume !(0 == ~n); 43416#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43538#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43533#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43530#ackermannFINAL assume true; 43527#ackermannEXIT >#47#return; 43525#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43523#ackermannFINAL assume true; 43518#ackermannEXIT >#43#return; 43519#L21-1 #res := #t~ret4;havoc #t~ret4; 43534#ackermannFINAL assume true; 43531#ackermannEXIT >#45#return; 43502#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43509#$Ultimate##0 ~m := #in~m;~n := #in~n; 43508#L17 assume !(0 == ~m); 43501#L20 assume !(0 == ~n); 43424#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43364#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43567#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43565#ackermannFINAL assume true; 43528#ackermannEXIT >#47#return; 43526#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43524#ackermannFINAL assume true; 43520#ackermannEXIT >#43#return; 43522#L21-1 #res := #t~ret4;havoc #t~ret4; 43615#ackermannFINAL assume true; 43614#ackermannEXIT >#45#return; 43376#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43517#$Ultimate##0 ~m := #in~m;~n := #in~n; 43512#L17 assume !(0 == ~m); 43513#L20 assume !(0 == ~n); 43344#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43465#L17 assume !(0 == ~m); 43462#L20 assume 0 == ~n; 43433#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43419#$Ultimate##0 ~m := #in~m;~n := #in~n; 43478#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43387#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43390#ackermannFINAL assume true; 43623#ackermannEXIT >#45#return; 43474#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43577#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43622#ackermannFINAL assume true; 43621#ackermannEXIT >#45#return; 43475#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43578#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43620#ackermannFINAL assume true; 43619#ackermannEXIT >#45#return; 43471#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43575#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43618#ackermannFINAL assume true; 43587#ackermannEXIT >#45#return; 43472#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43576#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43595#ackermannFINAL assume true; 43579#ackermannEXIT >#47#return; 43581#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43612#ackermannFINAL assume true; 43611#ackermannEXIT >#45#return; 43375#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43517#$Ultimate##0 ~m := #in~m;~n := #in~n; 43512#L17 assume !(0 == ~m); 43513#L20 assume !(0 == ~n); 43344#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43465#L17 assume !(0 == ~m); 43462#L20 assume 0 == ~n; 43433#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43419#$Ultimate##0 ~m := #in~m;~n := #in~n; 43478#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43442#L21-1 #res := #t~ret4;havoc #t~ret4; 43436#ackermannFINAL assume true; 43430#ackermannEXIT >#45#return; 43415#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43418#$Ultimate##0 ~m := #in~m;~n := #in~n; 43417#L17 assume !(0 == ~m); 43414#L20 assume !(0 == ~n); 43416#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43538#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43533#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43530#ackermannFINAL assume true; 43527#ackermannEXIT >#47#return; 43525#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43523#ackermannFINAL assume true; 43518#ackermannEXIT >#43#return; 43519#L21-1 #res := #t~ret4;havoc #t~ret4; 43534#ackermannFINAL assume true; 43531#ackermannEXIT >#45#return; 43502#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43509#$Ultimate##0 ~m := #in~m;~n := #in~n; 43508#L17 assume !(0 == ~m); 43501#L20 assume !(0 == ~n); 43424#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43364#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43567#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43565#ackermannFINAL assume true; 43528#ackermannEXIT >#47#return; 43526#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43524#ackermannFINAL assume true; 43520#ackermannEXIT >#43#return; 43522#L21-1 #res := #t~ret4;havoc #t~ret4; 43615#ackermannFINAL assume true; 43614#ackermannEXIT >#45#return; 43376#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43517#$Ultimate##0 ~m := #in~m;~n := #in~n; 43512#L17 assume !(0 == ~m); 43513#L20 assume !(0 == ~n); 43344#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43465#L17 assume !(0 == ~m); 43462#L20 assume 0 == ~n; 43433#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43419#$Ultimate##0 ~m := #in~m;~n := #in~n; 43478#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43387#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43390#ackermannFINAL assume true; 43623#ackermannEXIT >#45#return; 43474#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43577#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43622#ackermannFINAL assume true; 43621#ackermannEXIT >#45#return; 43475#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43578#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43620#ackermannFINAL assume true; 43619#ackermannEXIT >#45#return; 43471#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43575#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43618#ackermannFINAL assume true; 43587#ackermannEXIT >#45#return; 43472#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43576#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43595#ackermannFINAL assume true; 43579#ackermannEXIT >#47#return; 43583#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43610#ackermannFINAL assume true; 43609#ackermannEXIT >#45#return; 43378#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43517#$Ultimate##0 ~m := #in~m;~n := #in~n; 43512#L17 assume !(0 == ~m); 43513#L20 assume !(0 == ~n); 43344#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43465#L17 assume !(0 == ~m); 43462#L20 assume 0 == ~n; 43433#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43419#$Ultimate##0 ~m := #in~m;~n := #in~n; 43478#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43442#L21-1 #res := #t~ret4;havoc #t~ret4; 43436#ackermannFINAL assume true; 43430#ackermannEXIT >#45#return; 43415#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43418#$Ultimate##0 ~m := #in~m;~n := #in~n; 43417#L17 assume !(0 == ~m); 43414#L20 assume !(0 == ~n); 43416#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43538#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43533#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43530#ackermannFINAL assume true; 43527#ackermannEXIT >#47#return; 43525#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43523#ackermannFINAL assume true; 43518#ackermannEXIT >#43#return; 43519#L21-1 #res := #t~ret4;havoc #t~ret4; 43534#ackermannFINAL assume true; 43531#ackermannEXIT >#45#return; 43502#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43509#$Ultimate##0 ~m := #in~m;~n := #in~n; 43508#L17 assume !(0 == ~m); 43501#L20 assume !(0 == ~n); 43424#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43364#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43567#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43565#ackermannFINAL assume true; 43528#ackermannEXIT >#47#return; 43526#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43524#ackermannFINAL assume true; 43520#ackermannEXIT >#43#return; 43522#L21-1 #res := #t~ret4;havoc #t~ret4; 43615#ackermannFINAL assume true; 43614#ackermannEXIT >#45#return; 43376#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43517#$Ultimate##0 ~m := #in~m;~n := #in~n; 43512#L17 assume !(0 == ~m); 43513#L20 assume !(0 == ~n); 43344#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43465#L17 assume !(0 == ~m); 43462#L20 assume 0 == ~n; 43433#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43419#$Ultimate##0 ~m := #in~m;~n := #in~n; 43478#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43387#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43390#ackermannFINAL assume true; 43623#ackermannEXIT >#45#return; 43474#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43577#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43622#ackermannFINAL assume true; 43621#ackermannEXIT >#45#return; 43475#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43578#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43620#ackermannFINAL assume true; 43619#ackermannEXIT >#45#return; 43471#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43575#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43618#ackermannFINAL assume true; 43587#ackermannEXIT >#45#return; 43472#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43576#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43595#ackermannFINAL assume true; 43579#ackermannEXIT >#47#return; 43582#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43608#ackermannFINAL assume true; 43607#ackermannEXIT >#45#return; 43372#L23-1 [2023-02-19 00:15:26,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:15:26,701 INFO L85 PathProgramCache]: Analyzing trace with hash -630874818, now seen corresponding path program 10 times [2023-02-19 00:15:26,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:15:26,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631530723] [2023-02-19 00:15:26,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:15:26,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:15:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:26,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-19 00:15:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:15:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-19 00:15:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:15:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:15:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:15:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:15:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:15:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:15:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:15:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:15:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:15:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:15:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:15:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:15:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:15:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:15:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 16858 backedges. 435 proven. 2307 refuted. 0 times theorem prover too weak. 14116 trivial. 0 not checked. [2023-02-19 00:15:27,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:15:27,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631530723] [2023-02-19 00:15:27,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631530723] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:15:27,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732843359] [2023-02-19 00:15:27,928 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-19 00:15:27,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:15:27,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:15:27,931 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:15:27,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process [2023-02-19 00:15:28,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-19 00:15:28,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-19 00:15:28,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-19 00:15:28,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:15:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 16858 backedges. 449 proven. 2293 refuted. 0 times theorem prover too weak. 14116 trivial. 0 not checked. [2023-02-19 00:15:28,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:15:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 16858 backedges. 449 proven. 2345 refuted. 0 times theorem prover too weak. 14064 trivial. 0 not checked. [2023-02-19 00:15:28,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732843359] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:15:28,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:15:28,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 20 [2023-02-19 00:15:28,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88399226] [2023-02-19 00:15:28,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:15:28,990 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-19 00:15:28,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-19 00:15:28,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1588779923, now seen corresponding path program 8 times [2023-02-19 00:15:28,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-19 00:15:28,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141064244] [2023-02-19 00:15:28,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-19 00:15:28,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-19 00:15:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:15:58,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-19 00:16:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:22,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:34,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:16:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:41,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-19 00:16:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:16:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:16:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:16:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:16:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:16:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:42,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2023-02-19 00:16:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:47,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:51,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:54,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:55,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:56,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:56,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:16:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-19 00:16:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:16:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:16:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:16:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:16:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:16:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2023-02-19 00:16:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:57,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:16:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:16:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:16:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:16:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:16:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 921 [2023-02-19 00:16:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:16:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:16:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:16:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:16:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:16:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1330 [2023-02-19 00:16:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:16:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:16:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:16:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:16:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:16:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1739 [2023-02-19 00:16:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:16:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:16:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:58,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:16:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:16:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:16:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2148 [2023-02-19 00:16:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:16:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:16:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:16:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:16:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:16:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:16:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:16:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:16:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:16:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:16:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:16:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:16:59,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3073 [2023-02-19 00:16:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:00,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:01,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:01,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:01,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:01,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:17:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-19 00:17:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:17:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:17:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:17:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:17:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:17:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2023-02-19 00:17:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:17:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:17:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:17:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:17:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:17:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 921 [2023-02-19 00:17:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:17:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:17:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:17:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:02,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:17:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:17:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1330 [2023-02-19 00:17:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:17:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:17:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:17:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:17:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:17:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1739 [2023-02-19 00:17:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:17:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:17:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:17:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:17:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:17:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2148 [2023-02-19 00:17:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:17:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:17:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:17:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:17:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:17:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:03,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:04,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:04,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:04,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:04,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:04,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:04,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:04,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:04,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:04,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:04,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:04,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5634 [2023-02-19 00:17:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:05,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:05,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:17:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-19 00:17:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:17:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:17:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:17:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:06,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:17:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:17:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2023-02-19 00:17:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:17:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:17:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:17:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:17:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:17:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 921 [2023-02-19 00:17:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:17:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:17:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:17:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:17:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:17:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1330 [2023-02-19 00:17:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:17:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:17:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:17:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:17:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:17:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1739 [2023-02-19 00:17:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:07,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:17:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:17:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:17:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:17:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:17:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2148 [2023-02-19 00:17:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-19 00:17:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-19 00:17:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-19 00:17:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-19 00:17:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-19 00:17:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-19 00:17:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-19 00:17:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-19 00:17:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-19 00:17:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-19 00:17:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-19 00:17:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-19 00:17:08,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4420857 backedges. 22094 proven. 137296 refuted. 0 times theorem prover too weak. 4261467 trivial. 0 not checked. [2023-02-19 00:17:08,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-19 00:17:08,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141064244] [2023-02-19 00:17:08,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141064244] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-19 00:17:08,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174222060] [2023-02-19 00:17:08,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-19 00:17:08,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-19 00:17:08,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-19 00:17:08,724 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-19 00:17:08,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Waiting until timeout for monitored process [2023-02-19 00:17:12,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-19 00:17:12,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-19 00:17:12,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 22947 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-19 00:17:12,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-19 00:17:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4420857 backedges. 374678 proven. 609 refuted. 0 times theorem prover too weak. 4045570 trivial. 0 not checked. [2023-02-19 00:17:13,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-19 00:17:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4420857 backedges. 10662 proven. 104753 refuted. 0 times theorem prover too weak. 4305442 trivial. 0 not checked. [2023-02-19 00:17:16,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174222060] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-19 00:17:16,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-19 00:17:16,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 28, 39] total 62 [2023-02-19 00:17:16,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654685915] [2023-02-19 00:17:16,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-19 00:17:16,781 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-19 00:17:16,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-19 00:17:16,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-19 00:17:16,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-02-19 00:17:16,782 INFO L87 Difference]: Start difference. First operand 282 states and 366 transitions. cyclomatic complexity: 89 Second operand has 21 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 states have internal predecessors, (55), 15 states have call successors, (22), 2 states have call predecessors, (22), 7 states have return successors, (31), 9 states have call predecessors, (31), 14 states have call successors, (31) [2023-02-19 00:17:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-19 00:17:16,957 INFO L93 Difference]: Finished difference Result 193 states and 211 transitions. [2023-02-19 00:17:16,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 211 transitions. [2023-02-19 00:17:16,958 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-19 00:17:16,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 0 states and 0 transitions. [2023-02-19 00:17:16,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-02-19 00:17:16,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-02-19 00:17:16,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-02-19 00:17:16,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-19 00:17:16,959 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-19 00:17:16,959 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-19 00:17:16,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-19 00:17:16,959 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-19 00:17:16,959 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-02-19 00:17:16,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-02-19 00:17:16,960 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-19 00:17:16,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-02-19 00:17:16,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.02 12:17:16 BoogieIcfgContainer [2023-02-19 00:17:16,965 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-19 00:17:16,965 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-19 00:17:16,965 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-19 00:17:16,965 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-19 00:17:16,966 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 12:14:43" (3/4) ... [2023-02-19 00:17:16,968 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-19 00:17:16,968 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-19 00:17:16,968 INFO L158 Benchmark]: Toolchain (without parser) took 153852.86ms. Allocated memory was 174.1MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 139.0MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 813.8MB. Max. memory is 16.1GB. [2023-02-19 00:17:16,968 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-19 00:17:16,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 152.43ms. Allocated memory is still 174.1MB. Free memory was 139.0MB in the beginning and 129.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-19 00:17:16,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.47ms. Allocated memory is still 174.1MB. Free memory was 129.0MB in the beginning and 127.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-19 00:17:16,969 INFO L158 Benchmark]: Boogie Preprocessor took 21.94ms. Allocated memory is still 174.1MB. Free memory was 127.7MB in the beginning and 126.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-19 00:17:16,969 INFO L158 Benchmark]: RCFGBuilder took 178.76ms. Allocated memory is still 174.1MB. Free memory was 126.5MB in the beginning and 116.8MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-19 00:17:16,969 INFO L158 Benchmark]: BuchiAutomizer took 153475.25ms. Allocated memory was 174.1MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 116.4MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 790.8MB. Max. memory is 16.1GB. [2023-02-19 00:17:16,969 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 3.9GB. Free memory is still 3.0GB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-19 00:17:16,970 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 152.43ms. Allocated memory is still 174.1MB. Free memory was 139.0MB in the beginning and 129.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.47ms. Allocated memory is still 174.1MB. Free memory was 129.0MB in the beginning and 127.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.94ms. Allocated memory is still 174.1MB. Free memory was 127.7MB in the beginning and 126.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 178.76ms. Allocated memory is still 174.1MB. Free memory was 126.5MB in the beginning and 116.8MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 153475.25ms. Allocated memory was 174.1MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 116.4MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 790.8MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 3.9GB. Free memory is still 3.0GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (12 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -2 * \old(n) + 1 and consists of 4 locations. One deterministic module has affine ranking function n and consists of 8 locations. One deterministic module has affine ranking function m and consists of 10 locations. One deterministic module has affine ranking function m and consists of 8 locations. One nondeterministic module has affine ranking function n and consists of 8 locations. One nondeterministic module has affine ranking function \old(n) and consists of 15 locations. 12 modules have a trivial ranking function, the largest among these consists of 49 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 153.4s and 18 iterations. TraceHistogramMax:1341. Analysis of lassos took 145.8s. Construction of modules took 2.5s. Büchi inclusion checks took 4.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 17. Automata minimization 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 280 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 3, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 7/12 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1387 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1345 mSDsluCounter, 2141 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1687 mSDsCounter, 2102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5374 IncrementalHoareTripleChecker+Invalid, 7476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2102 mSolverCounterUnsat, 454 mSDtfsCounter, 5374 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT1 conc0 concLT1 SILN2 SILU0 SILI6 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital52 mio100 ax100 hnf100 lsp52 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq192 hnf94 smp100 dnf200 smp100 tf103 neg93 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 197ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 4 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 72 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 43 LassoNonterminationAnalysisSatUnbounded: 6 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-02-19 00:17:17,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Forceful destruction successful, exit code 0 [2023-02-19 00:17:17,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Forceful destruction successful, exit code 0 [2023-02-19 00:17:17,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Forceful destruction successful, exit code 0 [2023-02-19 00:17:17,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Forceful destruction successful, exit code 0 [2023-02-19 00:17:17,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Forceful destruction successful, exit code 0 [2023-02-19 00:17:17,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Forceful destruction successful, exit code 0 [2023-02-19 00:17:18,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Forceful destruction successful, exit code 0 [2023-02-19 00:17:18,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Forceful destruction successful, exit code 0 [2023-02-19 00:17:18,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Forceful destruction successful, exit code 0 [2023-02-19 00:17:18,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Ended with exit code 0 [2023-02-19 00:17:18,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Ended with exit code 0 [2023-02-19 00:17:19,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Ended with exit code 0 [2023-02-19 00:17:19,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Forceful destruction successful, exit code 0 [2023-02-19 00:17:19,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Forceful destruction successful, exit code 0 [2023-02-19 00:17:19,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Ended with exit code 0 [2023-02-19 00:17:20,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Ended with exit code 0 [2023-02-19 00:17:20,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2023-02-19 00:17:20,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE